Author: scott farrell
Date: 16:12:14 08/27/02
Go up one level in this thread
On August 27, 2002 at 09:05:13, Uri Blass wrote: with IID (yes internal iterative deepening), if you have no best move from the hash table (which is from a lower depth from normal iterative deepening) you search recursively at a depth of -2, then you read the hashtable again, and waallla !! (a magicians expresion when the rabbit does comeout of the hat), there is a best move to try - this revs up the move ordering a lot Scott >On August 27, 2002 at 08:05:43, scott farrell wrote: > >>Steffen, >> >>You need hashing before you can do IID. > >I assume that IID is internal iterative deepening(I do not know of another >meaning for IID. > >I do not understand what is the reason that a program need hash before it can do >IID. >Can you explain? > >Uri
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.