Author: Jon Dart
Date: 06:58:14 11/18/99
Go up one level in this thread
Arasan's format is documented in makebook.cpp (see also bookdefs.h and bookentr.h). Arasan divides the book into "pages". The first step in finding a move is to take the hash code modulo the number of pages. Then each page itself has a hashtable at the head of it. A probe into this hash table gets you the location in the page of the book moves. At this point you look at the full hash code (stored in the move entry) to make sure you have the right position. All moves for a given position are stored together. So, two hash lookups gets you the book moves. --Jon On November 17, 1999 at 23:10:22, James Robertson wrote: >My current book format is just an array of hash codes that the program jumps >through trying to find a match for the current position. There must be something >faster, so I am wondering what other people do. If programmers could explain to >me how their books are formatted, I would really appreciate it. > >Thanks in advance, >James
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.