Author: Gian-Carlo Pascutto
Date: 02:47:36 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 >Internal Iterative Deepening >Iterated Search I think interated search and iterative deepening are the same. Internal interative deepening uses reduced-depth alphabeta searches to get a best move inside the search, when no PV or hash move is available in a PV node. -- GCP
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.