Author: William Bryant
Date: 11:59:21 10/25/99
Since pawn evaluations are static, ie this pawn formation gives this score, the amount of information stored in a pawn hash table should be really simple. I was thinking of using a simple long long value. This gives 64 bits. Index the bottom 19 bits (that indexes 262144 positions for a table size of 2M)into the table Store the hash signature (64 bits) minus the bottom 16 bits for the score. Between the index and stored score that gives an overlap of 3 bits. This should prevent matching errors and keep the record size low. Is there any information I'll need that I'm leaving out. Thanks in advance. William wbryant@ix.netcom.com
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.