Author: Eric Oldre
Date: 14:32:31 04/08/04
Go up one level in this thread
I can tell you what i did, if i unerstand your question correctly what i wanted to know was to make sure that each 64 bit hash key was unique to one specific board state. so instead of computing the hash two different ways. i used the FEN notation of the board as a 2nd collision key. this allowed me to find some places where i hadn't properly updated my zobrist key (black long castle). of course i'm not sure if that is really what you want to know, but it might help. On April 08, 2004 at 09:08:19, Andrew Wagner wrote: >Hi all, > >I'm using a simple hashing scheme: a single replace-always tranposition table. >I've made sure all the hash keys are correct by comparing it to a key created >from scratch. But I'm not sure it's working as efficiently as it could be. So, >my question is: what statistics can I generate that will tell me how it's doing? >And what values should I be getting for those statisics, on average? > >Also, a slightly different topic: someone told me that with hash tables, and >without null-move, my move ordering (first-move fail-highs / total fail-highs) >should be averaging >95%. Does that sound right to the rest of you? Thanks! >Andrew
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.