Author: Mr. Ruben Razquin
Date: 12:28:55 05/05/00
I found a good example about how to program transposition tables at http://www.ics.uci.edu/~eppstein/180a/970424.html . I added a transposition table to my program an it works fine, but in some webs about chess programming I have found that the data structure for each element of the hash table contains one more piece of information: the best move found so far at the moment the hash table element was written. Can anyone tell me in which way is that move used and how ? Another question. I have started my implementation of transposition table using a hash code of 32 bits. How much bits should I use and why? Thank you for your help in advance.
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.