Computer Chess Club Archives




Subject: Question: Fail low at root and time management

Author: William Bryant

Date: 07:09:27 02/08/00

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.


This page took 0.04 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.