Author: Robert Hyatt
Date: 19:59:04 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 This has been done. BeBe was the first program I knew of that only did odd-ply searches in an attempt to stop the odd/even iteration score swings. The problem is that skipping a ply means the next iteration will take 9x as long rather than 3x, which is a problem for time controls...
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.