Author: Larry Griffiths
Date: 23:18:42 01/09/99
Go up one level in this thread
On January 04, 1999 at 15:06:35, Steve Maughan wrote: >I have been looking through the source code for Crafty and noticed that the >Search routine used "Internal Iterative Deepening" to get a good move to play at >an internal node. I was puzzled as to the actual benefit of this routine. I >can see that it will return a good move but assume that this is a costly method >for finding a such a move. Does it really speed up the search by that much? >How much? Does "everyone" do it? Steve, I used Iterative Deepening for time control. My program keeps increaseing its max depth and starting another search as long as time remains. max depth and start another search. The other reason I use it is to increase the efficiency of the alpha-beta search. The principle variation of the last iteration is used as a "Killer heuristic". The moves for the next iteration are ordered based on the previous iteration. This tends to increase the number of alpha-beta cutoffs.
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.