Author: Uri Blass
Date: 23:19:33 08/27/02
Go up one level in this thread
On August 27, 2002 at 19:12:14, scott farrell wrote: >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 I think that a program still can use IID without hash and it is going to use it in all nodes because there is always no best move from the hash. 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.