Author: Bas Hamstra
Date: 14:45:27 05/31/00
What is the philosophy behind Crafty's hashcode? I see a couple of things that make me wonder: - Black hashvalue is NOT-ted - 2 separate hashtables, one depth-preferred, one always-replace Is this fundamentally better than my method: - Table[Size][BucketSize] where BucketSize = 8 - With a "store" simply replace the worst depth of the 8 entries (is there is none empty) regardless of movecolor - A bit in the hashrecord indicates movecolor Note that a "retrieve" has to read 8 hashrecords worst case. It doesn't seem to slow me down much. I don't store D=0 nodes or qnodes. Comments are appreciated. Regards, Bas.
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.