Author: Michel Langeveld
Date: 21:13:12 11/18/99
Go up one level in this thread
On November 18, 1999 at 09:02:22, Robert Hyatt wrote: >On November 18, 1999 at 01:17:54, Michel Langeveld wrote: > >>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 >> >>The format is OK in my opinion (Crafty uses the same format). In this way it's >>possible to detect move-order-change, etc. I think if you sort the book you can >>find fast position by searching binairy. In this way if you have 65536 position >>you can find any book position by reading "only" 16 position from the book. >> >>Michel Langeveld > > >Crafty doesn't quite store like this. A hash signature is made of of part of >the parent's hash signature and part of the successor's hash signature. I >posted a detailed explanation here a week or so ago... Oops... I have read your explaination a few weeks ago globally and I thought I got the basic idea right. I shall dig up the old post and right it more thourougly. Michel Langeveld
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.