Author: Robert Hyatt
Date: 19:59:58 08/29/00
Go up one level in this thread
On August 29, 2000 at 14:59:13, Matt McKnight wrote: >I have tried to implement internal iterative deepening, but it doesn't help me >any. In fact, I require a lot more nodes with IID turned on. Perhaps I don't >totally understand the concept. Could someone explain to me how it works >please? it will kill you if you use it in the wrong places. I use PVS, so here is my approach: If I enter a node, where alpha != beta-1, then I am searching a PV node. If I don't have a hash table move, I do an internal iterative deepening search to get a best move to try first. That is the _only_ place it should be used. And since there are so few PV nodes searched in a typical iteration, it should hardly ever be needed...
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.