Author: José Carlos
Date: 13:39:56 06/20/00
Go up one level in this thread
On June 19, 2000 at 21:10:56, William Bryant wrote: >Not having a computer science background, I wonder how people organize their >opening book to make move lookup efficient. > >I have heard that people index by hash signature. Do you then clusture all the >subsequent moves together, or are they spread out throught the table? > >What means do you use to index into the table? > >In general I am looking for a general or specific discussion of how to oraganize >the data of an opening book and accessess it efficiently. > >You can guess, this is next on my to do list and I could use some >recommendations, instructions, suggestions, or even a step by step manuel, > "Opening Books for Dummies". > >Thanks in advance, > >William >wbryant@ix.netcom.com When I first tried to figure how to implement my book, I decided to load the book hash signatures into the hash table, and later decide a better implementation. The book is still there... Furthermore, I assess a zero value to those positions, and use them if the program goes out of book. This allows the program to have "reference points" in the search that can lead it to the book line again. After the opening, the book are removed from the hash table. Not a very good method, but an interesting idea, I think... José C.
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.