Author: Alvaro Jose Povoa Cardoso
Date: 08:42:58 12/17/01
in
struct tree [
...
int *last[MAXPLY]; ???
...
}
It seems to me that this a list of pointers.
----------------------------------------------------------
| |
| initialize. |
| |
----------------------------------------------------------
*/
if (ply >= MAXPLY-1) return(beta);
tree->nodes_searched++;
next_time_check--;
tree->last[ply]=tree->last[ply-1]; ???
o_alpha=alpha;
Also the following loop is used to loop thourgh all the moves.
for (movep=tree->last[ply-1];movep<tree->last[ply];movep++) {
.
.
.
}
Again I don't see from where the moves come from, although it seems that you
have some memory allocated somewhere and you use these pointers to index the
first and the last move from each ply.
Could you please explain where do you store the generated moves?
I really don't see where they get stored as they are generated.
Best regards,
Alvaro Cardoso
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.