Author: Guido Schimmels
Date: 01:10:34 08/03/98
Getting a fail-low at the root is annoying, as we don't know what move to play
for quite a while.
There is in article by Schaeffer et al. ("Advances in alpha-beta searching")
suggesting to restart the search in these cases (setting depth to 1 again),
exploiting the benefits of a hash-table and finding a new best-move quickly.
But nobody seems to use this, why ? (or am I wrong here ?).
An important implementation detail not mentioned in this paper is, how to do the
windowing up to the search depth we restarted from - if we do aspiration as
normal isn't there a danger to get caught in an eternal restarting-loop ?
- Guido -
This page took 0.01 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.