Author: Daniel Clausen
Date: 02:47:38 06/21/02
Go up one level in this thread
On June 21, 2002 at 05:13:36, Russell Reagan wrote: >In a post from yesterday Bob Hyatt mentioned many areas in computer chess that >have been written about and published in academic papers. He mentioned both >"iterated search" and "internal iterative deepening". I had only heard the term >iterative deepening (not internal iterative deepening, or iterated search). > >So what is the difference between: > >Iterative Deepening First search N plies, then N+1 plies, etc >Internal Iterative Deepening When Crafty (and other engines) don't have a a move from the HT and want to search N plies, they first make a search of N-2 (or something similar) and try to get a move this way. Of course the search for N-2 plies will again don't have a HT-move, because it's the same position. So this search will try a N-4 search first, and so on.. internal iterative deepening :) [Please someone correct me if I'm wrong here :)] >Iterated Search No idea, maybe out of context Sargon
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.