Author: Robert Hyatt
Date: 08:41:59 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 re-search... but then pay attention to the score. If the score is more than a pawn lower than the last iteration, I use more time, up to 5x more time in fact. Hoping that a different ply-1 move will eliminate this loss of material. > >Or, do you need to search all the root moves at the lower score to determine >which is truly the best move? I have tried this but didn't like it. It takes a long time to do this, and you _still_ don't know the best move if all fail low. So you are forced to search even longer to find something better. > >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 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.