Author: Robert Hyatt
Date: 21:13:22 02/12/01
Go up one level in this thread
On February 12, 2001 at 22:39:21, William Bryant wrote: >My understand is, Internal Iterataive Deepening is used when searching the >root PV node and you encounter a position for which there is no hash table >best move. Specifically, this is done during the full width part of the >tree (rather than the PVS part of the search). > >My program at present tests for this by comparing beta to alpha. >ie if (beta == alpha+1) then this is the PVS part of the tree and IID should >be skipped. > >This doesn't help at all so I think I'm missing something in the implementation. > >Any comments or suggestions would be appreciated. > >William >wbryant@ix.netcom.com I do an IID search when alpha != beta-1. This is pretty rare in a normal search so not seeing any improvement is not a big surprise. Look for a position where you fail high but don't get a score back. The next iteration will need IID to produce an efficient search, and there it should make a difference.
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.