Author: William Bryant
Date: 20:13:10 01/25/99
Go up one level in this thread
On January 25, 1999 at 22:30:03, William Bryant wrote:
>Shouldn't a mate-in-n score generate a cutoff and shorten the search
>significantly.
>
>My new hash table seems to work well, however, in the end game (no table bases
>yet), it finds mate-in-n but continues to search thousands and thousands of
>nodes.
>
>Does a mate in n score need to be handled differently or is my hash code buggy.
>
Can this be handled inside the iterative deepening loop
ie
#define MateScore (9999 - MaxIterations)
for (int depth = 0; depth < MaxIterations;depth++) {
x=search_Root(initialAlpha, initialBeta, depth);
if (x > MateScore) || (depth < -MateScore)
break;
//this is checkmate in the score backed up in the pv
}
or will this screw up bigtime somewhere.?
Is there a better way to handle this?
Thanks
William
wbryant@ix.netcom.com
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.