Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question on Search Windows

Author: David Eppstein

Date: 22:43:40 02/06/99

Go up one level in this thread


I know that the normal aspiration search windows are usually something like
previous search value +/- delta, where delta is a fixed parameter e.g. 1/2 pawn.

But has anyone tried setting the window in a more complicated way that
incorporates information from the last several searches? One could get an
estimate of the variance of scores from search to search, which might help
narrow or widen the window in situations where that helps. For instance, maybe
in place of delta one could use (some parameter times) the difference between
the last two search scores.  It's might also be possible that a non-centered
window would sometimes be appropriate.

I know Bob and others have collected statistics on how often the best move
changes in deep searches; are there similar statistics on how much the eval
changes and whether there's much correlation between successive changes?



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.