Author: Andrew Wagner
Date: 06:08:19 04/08/04
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.