Author: Thomas McBurney
Date: 19:54:36 03/17/03
Go up one level in this thread
On March 17, 2003 at 21:54:36, Nathan Thom wrote: >Im having troubles trying to figure out what to do with my search results when a >timeout occurs. eg I could have searched 10 plies fully, and am part way through >the 11th ply when time runs out. > >The simplest thing to do is ditch all results from the last incomplete search >and just go with what you had after 10 plies. But this seems a big waste. > >Thoughts? Well, when your program reaches the 11th ply then the very first 10 moves it would make, when starting the 11 ply search, would be based on the best PV found on the previous search of 10 plies. So your PV would be updated very quickly when searching the 11th ply. The issue then would be if the score suddenly drops when it finds a good counter move for the opponent, then you would have to extend the search time to try to find a better move. Good move ordering helps reduce the amount of time spent to find a better move here (if one exists). If you cannot extend the search time then I guess you have no choice but to go with the best move found so far. Cheers, Tom
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.