Author: Antonio Dieguez
Date: 15:37:04 02/27/01
Go up one level in this thread
Hello, at least in my chess program, stepping by 2, with a little of bad luck it can have a branching factor of near ~25 or more, so if I have used let say 1/9 of the time I doubt I would step by 2 next iteration, so in this case starting at this point I would step by 1, only earlier I would err... "have had stepped"(?) by 2 but 1/9 of the time is nothing, doh. That is only one aspect but may be enough. have a nice day. >By definition the iterative deepening procedure calls Search() several times, >and each time it increments _Depth_ by one. >But what if we increment by two? >Isn't a waste of time stepping just one ply deep at a time? >In my checkers program, I increment _Depth_ by two (2,4,6,8,10,12,14,16...) and >it seams to work better than stepping by one ply (2,3,4,5,6,7,8,9,10,11,12,...). >Surely a previous search at _Depth-2_ gives a good PV to try first at this >iteration. >Comments anyone? >Does this aply to chess? > >Thank you >Alvaro Cardoso
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.