Author: Landon Rabern
Date: 09:38:25 06/13/01
Go up one level in this thread
On June 12, 2001 at 18:45:54, Scott Gasch wrote: >> >>What kind of collision resolution method do you use for your hash table? > >It occurs to me you may mean the hash table used when creating the opening book >and not the transposition table of the engine, as I assumed. > >I use linear probing... basically if there's a collision check the next entry >and so on until one that matches is found. As I said I then strain out >unpopular positions from the book when the hash starts getting full. I can >construct a new book from a 650,000 game PGN file in about 8 minutes on my >machine. (Granted it has 596Mb of memory). > >Scott yes, that is what I meant. Why don't you use a similar scheme on disk to store your book? The running time of a retreive on this hash table scheme must be fast than the log(n) of the binary search. Landon
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.