Author: Matthias Gemuh
Date: 10:21:14 11/28/02
Go up one level in this thread
On November 28, 2002 at 04:42:26, Sune Fischer wrote:
>On November 28, 2002 at 04:36:59, David Rasmussen wrote:
>
>>On November 28, 2002 at 04:23:15, Sune Fischer wrote:
>>
>>>My present book format is really simple, too simple.
>>>
>>>I would like to use transpositions and book learning, so I need a new format.
>>>
>>>Is there a "standard" way of doing this, some well known technique which
>>>includes statistics for each line and makes it possible to transpose back into
>>>the book?
>>>
>>>I can only think of primitive ideas, like storing the full FEN and append each
>>>possible move reply to it. That will of course blow the book to a huge file. I
>>>guess some other hashing scheme can be done, but what is the _best_ way? :)
>>>
>>
>>If you use zobrist hash keys (which you already have, if you have traditional
>>hashing), transpositions are dealt with automatically. There are other issues to
>>deal with, but hash keys will get you started.
>
>True, but my gut feeling is that storing 8 bytes per position (plus their moves)
>still makes quite a large book? I guess 6-7 bytes will be enough though.
>
>-S.
>
My book record is
typedef struct {
unsigned long HashKey, HashLock;
CHESSMOVE Move;
int Result, lrnResult;
unsigned int Count;
} BOOKENTRY;
/Matthias.
This page took 0.01 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.