Author: Robert Hyatt
Date: 08:11:10 07/27/04
Go up one level in this thread
On July 27, 2004 at 03:18:50, Sune Fischer wrote: >On July 25, 2004 at 22:01:31, Robert Hyatt wrote: > >>Bad idea. Start the next iteration even if you don't think you will have time >>to finish it. You might fail low. Wouldn't that be nice to know? :) > >This may or may not be a good idea. > >I think if it is a good idea, then you should always try and search the next >iteration for a short time to see if you get a quick fail-low. > >On the other hand, if it is a bad idea it is better to save the time that will >probably be wasted anyway. > >From what I can tell you propose to do a mixture, i.e. to use extra time if the >time manager tells you to? > >I really doubt this is the best way, because it will be extremely random when >you get to begin the next ply. No idea what that means. I set a target time. If I have not used that much time, I keep searching. Whether that means starting a new iteration or continuing on the current iteration. When the target time is reached, I set a flag that says "do not search another root move, but don't stop until either the current root move has been searched or 2x the time limit has been used." This does not apply if the root move being searched is the first one in the list... Works fine. Always has worked fine. Prevents several problems. IE if it is going to fail low, I give it a chance rather than saying "next iteration can't be completed, so don't start it." Also if I am in the middle of searching a root move that may become the new best move, I don't quit. Normally after the first root move, the rest are searched very quickly thanks to null-move. But I don't start on any single root move without completing that particular search, to avoid missing something important. I _always_ start the next iteration even if there is only one second left, as I don't do my time check in Iterate() but only inside the search itself. > >-S.
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.