Computer Chess Club Archives




Subject: Re: Question: Fail low at root and time management

Author: John Stanback

Date: 11:28:17 02/08/00

Go up one level in this thread

On February 08, 2000 at 10:09:27, William Bryant wrote:

>I need some recomendations on handling time management when the program
>fails low at the root near the end of the alloted search time.
>(During game play, not during test suites)
>How do people handle this?
>Do you research the PV move at the lower window (which will return a
>move and a score) and then stop?
>Or, do you need to search all the root moves at the lower score to determine
>which is truly the best move?
>The later makes more sense, but may consume a significant chunk of additional
>time which the program may or may not have.
>Thoughts, ideas and suggestions gratefully accepted.

If the first move fails low, I increase the time allotment by 10X
and then search the remaining moves using the same window, but with
a reduced depth.  If any of the remaining moves don't fail low at
the reduced depth then I immediately re-search the move to the correct
depth.  If I get a move with an ok score (not fail low) at the
correct depth and the original search time limit is exceeded then
I play that move.  If all moves are searched this way and fail low
then the window is lowered and the search procedure starts over.

By the way,  I use windowed alpha-beta rather than PVS.


This page took 0.13 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.