Author: Alessandro Damiani
Date: 02:00:18 10/20/02
Go up one level in this thread
>
>- I didn't add the code to avoid making a null-move when in check to simplify
>the algorithm. in the end we have something like the following in qsearch.
>
> if (inCheck)
> best= -MATE+ply;
> else {
> make(null-move);
> best= -captsearch(-upper, -lower);
> unmake(null-move);
>
> if (best>=upper)
> return best;
> }
>
Oops, I switched from
best= -INFINITY
to
best= -MATE+ply
in the code above without reconsidering a cut-off. So here is the corrected
code:
if (inCheck)
best= -MATE+ply;
else {
make(null-move);
best= -captsearch(-upper, -lower);
unmake(null-move);
};
if (best>=upper)
return best;
Alessandro
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.