Author: Marc-Philippe HUGET
Date: 08:31:29 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? > >Thanks for any help! >James Hi, It is a good question! In fact, as I said in a previous thread, you have two choices: either you want a fast fat method like hash table with positions or you have a not so slow light method where you store lines in a factorized way like this: (e4(e5(d4 ...)(Nf6 ...))(d4(d5 ...)) You have to play each move but it is a good method as Kittinger said. I realize a program BookBuilder in order to build this kind of book and as I release code, you can modify it for your needs. http://members.xoom.com/mphuget/ladame.htm and BookBuilder at the end of the page. Best regards, 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.