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. William wbryant@ix.netcom.com
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.