Author: KyoJin Kim
Date: 07:32:51 03/26/98
Hi, Bob!
I try to understand source code of Crafty.
I KNOW BASIC deep alpha beta pruning of negamax searh algorithm.
I have question about this this part of code in search.c.
if (first_move) {
value=-ABSearch(-beta,-alpha,ChangeSide(wtm),
depth+extensions,ply+1,DO_NULL);
}
else {
value=-ABSearch(-alpha-1,-alpha,ChangeSide(wtm), <=== ????
depth+extensions,ply+1,DO_NULL);
if (value>alpha && value<beta) {
value=-ABSearch(-beta,-alpha,ChangeSide(wtm),
depth+extensions,ply+1,DO_NULL);
}
}
Could you explain to me this part?
Is there any book or document which explanin about this (windows ?) ?
Thank you in advance.
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.