Author: Scott Gasch
Date: 17:08:22 08/24/02
Go up one level in this thread
On August 23, 2002 at 14:48:19, Brian Richardson wrote: >On August 23, 2002 at 14:41:11, Dann Corbit wrote: > >>http://www.talkchess.com/forums/2/message.html?41900 > >This looks like an interesting variation on internal iterative deepening IID, >but with generally deeper sub-searching. It sounds like he is doing this reduced depth search at _every_ node where there is no best move from the hash table. I have no implemented IID in my own engine but my understanding of the concept is that it is only applied at PV nodes where there is no best hash move typically. Is this correct? Scott
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.