Author: Ernst A. Heinz
Date: 15:31:01 12/05/00
Go up one level in this thread
>>Hi Scott, >> >>>When storing a hash position the depth you store with it is the depth you used >>>to search and arrive at this position, correct? >> >>No -- the depth draft stored in the hash table should equal >>the *remaining depth* of the search tree beneath the node >>in question. >> >>=Ernst= > >That depends on how he wrote the rest of the hash code. Not really, if you actually want to use your hashed information to cut off the search or to narrow the alpha-beta bounds. Only storing the path length from the root node does not allow you to do so. =Ernst=
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.