Author: William Bryant
Date: 18:10:56 06/19/00
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
This page took 0.01 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.