Author: William Bryant
Date: 19:52:10 09/07/99
I was reviewing my code, and noted in the root search when the score obtained is > alpha (and < beta) I was doing the following: alpha = score; beta = alpha + WindowSize; I thought this idea came from Crafty, but now I can't find it in the Crafty source. Further, although it makes the initial ply's slightly slower, it speeds up the search overall and improves the LCTII score as well. Question: Is there any harm in updating beta to the aspiration window size at the root when a score is backed up to the root and alpha is changed? Is this idea good, bad, neither? Did this come from Crafty at one point? 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.