Author: Gian-Carlo Pascutto
Date: 11:10:37 12/28/99
Go up one level in this thread
On December 27, 1999 at 13:38:29, Robert Hyatt wrote: >Here is what I think is the right way to do this, as was done in Cray Blitz >and Belle: > >search the first move with a tight aspiration window. Search the rest with >a null window. If one fails high, mark it as "best" but don't re-search it >yet. If that is the only one that fails high, it is the best. If a second >move fails high, re-search one with a wider window to get a real score, then >search the second to see if if it fails high. If not, the first is the best, >otherwise the fail-high move is the best. > >The only problem with this is that you can start a new iteration without a PV. >If you use internal iterative deepening, this shouldn't be a problem. If you >don't, it can cause problems... > >However, many hate getting a fail high without knowing whether the move is >a centipawn better or a rook better. :) Well, thats seems quite logical to me. After all, how are you going to set the bounds on your next interation's aspiration search if you don't have a score to go with ? You'll almost certainly end up with a fail-high or fail-low again. -- GCP
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.