Author: Nathan Thom
Date: 17:36:55 01/19/03
What kind of error rates do people here get with their hashing algorithms. I mean, when you check for a position in the hash table, verify they have the same checksum and then find out (through a quick test for a valid move or something) that the position stored is actually different to the current position. I think LittleThought is getting way too many errors, but I cant figure out why. Any thoughts are appreciated.
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.