Author: Ricardo Gibert
Date: 17:00:58 06/22/02
Go up one level in this thread
On June 22, 2002 at 17:15:42, Russell Reagan wrote: >Would it be more advantageous to use iterative deepening with an increment of 2 >instead of 1? In other words, instead of searching 1 ply, 2 ply, 3 ply, 4 ply, >etc. you would search 2 ply, 4 ply, 6 ply, 8 ply, etc. Would this change >anything at all? > >Russell A very long time ago (in computer chess time scale), there was a top computer chess programmer that did this, but he later abandoned it. Sorry I can't remember the name of the programmer or the name of the program.
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.