Author: Frank Phillips
Date: 12:00:36 12/11/00
What is the standard approach to selecting the (root) move in an iterated search when time runs out part way through the next iteration at the next depth. Going back to the pv for the last completed iteration sometime seems a waste, particularly with hash tables when it could have taken less than a second to get to that point and especially when the next incomplete iteration has a different root move. Using the pv based on a partially completed search could be bad since had it continued a refutation might have been found. Equally it could have turned out to good……….. In my search I do not even start the next iteration is there is less than 50 percent of the total allowed time left. Frank
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.