Author: Robert Hyatt
Date: 17:40:56 12/05/00
Go up one level in this thread
On December 05, 2000 at 18:16:28, Ernst A. Heinz wrote: >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= Even more important... as you stomp down the pv path, don't forget to increment the depth just as you would for a real search down that path. IE checks, recaptures, etc... and as you go a ply deeper, decrement depth accordingly. Otherwise you will have _lots_ of fun debugging.
This page took 0.01 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.