Author: Steffen Jakob
Date: 00:01:43 12/18/03
Go up one level in this thread
On December 18, 2003 at 00:10:01, Albert Bertilsson wrote: >You're right Keith, some considerable cheating is done by using hash tables to >"boost" node counting. But even without it I still think that the project would >reach VERY high node counts, perhaps almost 1BNPS (when testing at home I solve >problems twice as fast with hash tables so perhaps even 2BNPS are counted by the >computers). What are you using as the hash key? 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. Greetings, Steffen.
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.