Author: Dave Gomboc
Date: 12:00:07 09/30/99
Go up one level in this thread
On September 30, 1999 at 13:33:26, David Eppstein wrote: >But, you could keep a flag for each root move, saying whether it failed low >in the current window. If the flag is set, you don't bother searching that >move in later windows. If the search for a given guess fails low, you narrow >the window without updating any of the flags. If the search for a given guess >fails high, you narrow the window and flag any move that failed low in that >search. Then, you can stop when there is only one unflagged move. The first thing that should happen when you go to search such a move is that you will get a hash hit with an upper bound that is lower than the bound you are searching. This will immediately cause the algorithm to move on to the next move. I think this would be less work and just as quick as maintaining some list of flags by yourself. Dave
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.