Author: Will Singleton
Date: 22:18:03 06/19/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 There are many resources for opening book methods on the web and elsewhere. My opening book is rather basic, so I have nothing to offer directly. However, you might want to check the homepages of the various programmers here, perhaps check out all the links available from this site and the many others. If that fails, I recall Andrew Williams having posted a succinct intro to opening book design, which I saved but haven't had time to examine in detail. And there's always the many book articles in the ICCAJ which cover the subject nicely. Maybe Andrew will post his article again. Will
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.