Author: Uri Blass
Date: 05:14:51 05/25/04
Go up one level in this thread
On May 25, 2004 at 07:59:33, Tord Romstad wrote: >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? Yes Junior from the beginning does it. If we assume that depth x of junior is x/2 plies then Junior add 3/2 ply every iteration from the first iteration and only in the last iterations it add less than it (it can be 1 ply or 1/2 ply dependent on the time control and the time it took it to finish the last iteration). 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.