Author: Tord Romstad
Date: 04:59:33 05/25/04
In all implementations of iterative deepening I have seen, the search depth is always incremented by exactly one ply between each iteration. Is there any reason to believe that this is optimal? Has anybody tried other increments? I am now running some tests with an increment of 3/4 of a ply. So far, the results don't seem very different from the usual 1 ply increment. If it turns out that increments different from 1 ply are no worse, this could perhaps be useful in time management. The engine could use 1 ply increments most of the time, but occasionally add only half a ply if just a small amount of the allocated thinking time is left. Any thoughts about this? Tord
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.