Author: Dann Corbit
Date: 14:54:42 10/12/01
Go up one level in this thread
On October 12, 2001 at 16:10:19, Bert van den Akker wrote: >On October 12, 2001 at 13:55:36, Alvaro Jose Povoa Cardoso wrote: > >>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 > > >See this site: http://members.ams.chello.nl/dbreuker/thesis/index.html > >everything about hashing! The transposition table chapter is available separately: http://members.ams.chello.nl/dbreuker/thesis/chapter2.zip
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.