Author: Inmann Werner
Date: 01:55:58 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 Some ideas.. There are two ways, storing a book. Either to store positions, or to store moves. Storing moves. Here you store the current position (Hashcode?) with a possible move and all its data (win, loss....) There are multiple records for the current position (one record per move) storing positions. You store only positions and their data(win,loss) etc. For each possible position one record. At searching time, you have to have a list of all possible moves, make the move and look, if the resulting position is in the book. Which of the methods do you use, or is there a third one? Werner
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.