Computer Chess Club Archives

Search

Messages

Subject: Re: Depth in Hash table

Author: Andreas Herrmann

Date: 08:24:43 02/13/01

Go up one level in this thread

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

• Re: Depth in Hash table Robert Hyatt 11:09:37 02/13/01
  • Re: Depth in Hash table Frank Phillips 14:23:50 02/14/01
    • Re: Depth in Hash table Robert Hyatt 20:10:07 02/14/01
      • Re: Depth in Hash table Frank Phillips 12:14:42 02/15/01
        • Re: Depth in Hash table Robert Hyatt 13:54:41 02/15/01

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.