Author: Alex Boby
Date: 22:58:00 05/07/01
This has probably been asked a thousand times in the past so sorry for asking but I grep'd the archives and didn't find anything satisfying so here goes... How do most people deal with hash key collisions (2 positions, same key)? These cause problems for me currently because of illegal moves. I figure that there are 2 solutions... 1) store the actual unique board position in the hash record for comparision. 2) check the moves stored in the hash table to see if they are valid before using them. 1 doesn't seem like a plausible solution (gigantic hash records) and 2 seems like it would be slow unless I could find a trick to do it easily. Is there a standard solution to this problem? Alex
This page took 0.01 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.