Author: Brian Richardson
Date: 14:40:13 05/05/00
Go up one level in this thread
On May 05, 2000 at 15:28:55, Mr. Ruben Razquin wrote: >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. Assuming you have a function that can determine the validity of a move, try to make the hash table move BEFORE even generating moves, just as you would try killers, even if the hash score does not give you a cutoff due to insufficient draft. 32 bits will not be enough--I think 64 is adequate.
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.