Author: Marc-Philippe HUGET
Date: 23:17:50 04/20/99
Go up one level in this thread
On April 20, 1999 at 19:21:07, James Robertson wrote: >Thanks guys for your responses; let me think about them for a bit. I forgot to >mention: my book is a list of hash codes that are sorted numerically. My engine >jumps around through the numbers until it zeroes in on the hash code that >matches. If there is a match, then that move is in the book. This is wonderful >for small books but gets bad fast with larger ones. For instance, my program >often can only make three book moves a second, and it's book is just 413k (26418 >entries). Hi, Strange! What language? If you use MFC, you have collection classes. In experimental version of my program, I have a book of roughly 600Mb, yes it is huge, my solution: database, I find one move in less than one second on my PII450. You might cache your book in memory, it is a good and simple solution. Marc-Philippe
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.