Author: Ricardo Gibert
Date: 19:43:57 01/19/03
Go up one level in this thread
On January 19, 2003 at 20:36:55, Nathan Thom wrote: >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. In addition to hashing the move into the signiture, you should also be including castling rights, en passant and turn to move. The latter in particular will produce lots of unwanted collisions and seems to fit the description of your problem.
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.