Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Depth in Hash table

Author: Robert Hyatt

Date: 11:09:37 02/13/01

Go up one level in this thread


On February 13, 2001 at 11:24:43, Andreas Herrmann wrote:

>On February 13, 2001 at 10:10:50, Robert Hyatt wrote:
>
>>On February 13, 2001 at 06:52:05, Andreas Herrmann wrote:
>>
>>>Have i to store the depth information to the hash table with or without the
>>>extension??
>>>
>>>Andreas
>>
>>Since you probe at the front of search, if you apply any extensions before you
>>probe (ie in-check or whatever) then you should apply the same extension before
>>you store. It is critical that the depth you store is the same as the depth
>>you probe for given the same position.
>
>Hi Robert,
>
>i often look to your code, but i have little problems to understand some parts
>in C code, because i'm a delphi developer.
>If i saw it right in your code, you stores the depth without the extension to
>the hash.
>
>Andreas


That is right, but _be careful_.  Note that in Crafty, a check extension is
done when the check is played, rather than at the next ply after determining it
is in check there.  The main thing is to simply be sure that you are consistent
in the 'depth' value you use for probing and for storing.  IE if you store a
modified depth value, then you need to modify it before you do the corresponding
probe to get consistent results.



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.