Author: Vincent Diepeveen
Date: 08:13:31 05/27/04
Go up one level in this thread
On May 25, 2004 at 07:59:33, Tord Romstad wrote: i experimented extensively with this matter when i did a lot of forward pruning (around 1999) in diep. I used an old idea: bad move = 2 units good move = 1 unit Later i extended the experiment shortly even to : very bad move = 3 units tactical move or tactical bad move which positional is incredible good = 2 units good move = 1 unit In that later experiment sometimes raising iteration depth by 2 made sense, but in majority of cases just adding 1 was giving best effect. The worst case of adding more than 1 ply at once is just losing your games. This is the problem. In 100 tricks it might work, but then you get a complex position at board where engine doubts and only can play 1 move. Then you're dead getting a 9 ply search. >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 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.