Author: Nicolas Carrasco
Date: 16:05:32 10/26/99
Dear Guys,
I am still haveing problems storeing the PV data at this simple Alpha-Beta
Algorim.
int AlphaBeta (depth, alpha, beta)
{
int score;
if (depth == 0)
return Evaluate(pos);
succ = Successors(pos);
i = 0;
while (i<succ)
{
i++;
if (make_move(move_list[i])) {
score = -AlphaBeta (-depth, -beta, -alpha);
unmake_move();
if(score>alpha){
if (score>beta)
return beta;
alpha = score;
}
}
return alpha;
}
Many arrays programs put something like this:
pv[ply][ply] = move[ply].b[i];
for(j=ply+1;j<pv_length[ply+1];j++)
pv[ply][j] = pv[ply+1][j];
pv_length[ply] = pv_length[ply+1];
Where I have to put that? How it works?
Thanks
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.