Computer Chess Club Archives

Search

Messages

Subject: Re: Hash table bug

Author: Volker Böhm

Date: 01:49:23 05/13/04

Go up one level in this thread

Hi,

more information is needed.
In one kind of hash implementation the search after "undo" should return a1b1 at
ply 1!
Reason: when starting search it should look at the hash, find an entry with
depth==25 and result move a1b1 with an exact score. Thus he should take this
result.
Debug at ply 0 why this don´t happen.

If you "age" hash-entries by other than move-count and you will not use "aged"
entries-score then and older hash entries are just used for move ordering it
should react different.
In this case check if you are correctly overwriting "aged" hash entries even, if
remaining depth is lower than the remaining depth of the hash entry.

Greetings Volker

• FIXED: Hash table bug Jeff GAZET 04:45:25 05/13/04
  • Re: FIXED: Hash table bug Aivaras Juzvikas 10:51:55 05/13/04
  • Re: FIXED: Hash table bug Robert Hyatt 10:11:04 05/13/04
    • Re: FIXED: Hash table bug Jeff GAZET 10:39:10 05/13/04
      • Re: FIXED: Hash table bug Robert Hyatt 11:21:07 05/13/04
      • Re: FIXED: Hash table bug Fabien Letouzey 11:10:40 05/13/04
        • Re: FIXED: Hash table bug Dieter Buerssner 13:15:54 05/13/04
          • Re: FIXED: Hash table bug Fabien Letouzey 04:44:47 05/14/04

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.