Author: Peter McKenzie
Date: 14:03:59 04/20/99
Go up one level in this thread
On April 20, 1999 at 11:00:08, James Robertson wrote: >I have become dissatisfied with the way my program searches for moves in it's >book; it simply takes too long. How do other programs do this? If I look at the >Crafty bookmaking code, I see stuff about "clusters". What does this mean? How >do EXchess, or Comet or other programs search their books? LambChop just has a bunch of positions in a hash table in memory. Access is super fast, but probably not a great method if your book is huge (mine most definitely isn't). > >Thanks for any help! >James Peter
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.