Author: Pat King
Date: 08:06:14 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? I don't see what this gains you. You've got the move. You don't need the score. Thus, if you're truly short of time, just play the move. > >Or, do you need to search all the root moves at the lower score to determine >which is truly the best move? This is of course the better option, because if your score is unknown, your PV is suspect. But, as you note, it's hard to predict how long a search will take. > >The later makes more sense, but may consume a significant chunk of additional >time which the program may or may not have. One needs a 'panic time' limit beyond which one merely plays the PV. I haven't found a way to set this limit that I really like, though. It should probably change throughout the game. > >Thoughts, ideas and suggestions gratefully accepted. > >William >wbryant@ix.netcom.com
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.