Is there a program that can ...?

[Jim Monaghan]

Geschrieben von:/Posted by: Jim Monaghan at 14. July 2004 15:02:

Hi,
Imagine you have a pgn file of say 100,000 wins for White. You are going to make a book for your favourite engine from the White side. Is there a program that can take that database and for every decision point on the tree to save only the most frequent responses, say the top 3 or 4 replies from the White side and of course leave all the moves from the black side. The assumption here is that those replies would be the strongest. Pretty safe assumption in general if the games are from high rated strong players. Then you would take the same approach from the Black side. Merge the two files and run your book maker. Right now, as a human I labouriously go through each point in the tree (using Scid) to say a depth of 8 to 10 moves and eliminate undesireable moves. This is a lot of work. Is there some way to automate the process. And then steer the book into interesting areas once you have a "cleaner" file to work with.
Can any program out there do that? Commercial or otherwise? Would it be hard for someone to write it?
Thanks,
Jim

[Andreas Herrmann]

Geschrieben von:/Posted by: Andreas Herrmann at 14 July 2004 19:21:15:
Als Antwort auf:/In reply to: Is there a program that can ...? geschrieben von:/posted by: Jim Monaghan at 14. July 2004 15:02:

Hi,
Imagine you have a pgn file of say 100,000 wins for White. You are going to make a book for your favourite engine from the White side. Is there a program that can take that database and for every decision point on the tree to save only the most frequent responses, say the top 3 or 4 replies from the White side and of course leave all the moves from the black side. The assumption here is that those replies would be the strongest. Pretty safe assumption in general if the games are from high rated strong players. Then you would take the same approach from the Black side. Merge the two files and run your book maker. Right now, as a human I labouriously go through each point in the tree (using Scid) to say a depth of 8 to 10 moves and eliminate undesireable moves. This is a lot of work. Is there some way to automate the process. And then steer the book into interesting areas once you have a "cleaner" file to work with.
Can any program out there do that? Commercial or otherwise? Would it be hard for someone to write it?
Thanks,
Jim

Hi,
i'm doing the following in BlackBishop for creating a book:
At first step, all games were played virtual internally, and each position and move is stored in a temporay file, with the help of the hash keys.
At the second step, BB generates from this temporay file, the real book, using the params "min. % white result" for white book moves and "min. % black result" for black moves and also a param "min. playing count" will be used.
From the result scores and playing count of each move, i generate a number for move selecting. If a move is playd more often than another and has a better result, it gets a higher score inside the book.
For a programmer it's easy to write such a code. As far as i can remember it has taken me about 2 or 3 hours to write it, including the function GetMoveFromBook. The positions in my book are sorted by hashkeys, so i don't need a separate index file for a fast search.
best wishes
Andreas