Computer Chess Club Archives

Search

Messages

Subject: Hash replacement scheme

Author: Alvaro Jose Povoa Cardoso

Date: 10:55:36 10/12/01

I red some stuff somewhere of a hash replacement scheme that uses the node count
of the subtree bellow the node we are considering.
It came to my mind the following:
At the top of the search we probe the hash table for a position and we would use
this node count to determine if the hash position should be given credit or not.
_But_ at the top of the search we simply don't have a node count of the subtree
bellow this node because we didn't search anything yet.
So my question is: How do we compare the current position (wich has no subtree
node count) with the hash position (wich has a subtree node count)?
Using the 'draft'  instead o f the node count we don't have this problem.

Any comments, please?

Regards,
Alvaro Cardoso

• Re: Hash replacement scheme Bert van den Akker 13:10:19 10/12/01
  • Re: Hash replacement scheme Dann Corbit 14:54:42 10/12/01
• Re: Hash replacement scheme Robert Hyatt 11:05:50 10/12/01
  • Re: Hash replacement scheme Alvaro Jose Povoa Cardoso 13:48:32 10/12/01
    • Re: Hash replacement scheme Robert Hyatt 13:51:06 10/12/01
      • Thanks, I got it now. Alvaro Jose Povoa Cardoso 14:10:26 10/12/01
  • Re: Hash replacement scheme Bob Green 11:39:30 10/12/01
    • Re: Hash replacement scheme Robert Hyatt 11:42:52 10/12/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.