Author: Russell Reagan
Date: 22:24:27 12/18/03
Go up one level in this thread
On December 19, 2003 at 01:00:31, Steffen Jakob wrote: >I repeat my posting from below because the ruffian thread pushed it very fast to >the bottom of the message list. :) > >What are you using for the hash key in your distributed perft implementation? >How do you make sure that there are no hash key collisions which are possible in >the usual zobrist key approach? Those collisions are too rare to influence the >playing strength of a chess engine but would make the result of your perft >project invalid. I remember Albert saying that he uses 128-bit hash keys, which is not theoretically sound, but should work in practice. Deiter also uses hash tables for this I think. Maybe he can tell us what he does.
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.