Author: Uri Blass
Date: 02:49:25 03/16/01
Go up one level in this thread
On March 16, 2001 at 05:12:49, Matt McKnight wrote: >The best way to get the most searching done within the time limit is to check >your time during the search. If time is up, return alpha and don't go to the >next iteration. > >It isn't wasting time to start searching into the next iteration (no matter how >much time is left for this move) because even searching only 100 extra nodes >could give you a better move than the one you already have. There are cases when you know that searching only extra 100 nodes is not going to give you a better move. If you finish an iteration after some minutes then you can be sure that you cannot even get a score for the first move in the next iteration with only extra 100 nodes. I use this rule for deciding when to stop the search of chess programs in my correspondence games. If my computer finished an iteration after 10 hours then usually I am not going to wait for it in order to see if it changes it's mind. If my computer is at the middle of the iteration after 10 hours then I may wait because the probability to get a different move is higher. Uri
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.