chessdev wrote:target size is under 20kb. all we really need is variety. maybe cutting off the book at 5 or 8 or 10 moves would work. even cutting off at 5 moves would yield thousands of possible games. smaller the better as it has to load in the browser.
/*
* We now allocate memory for the book dynamically,
* according to the size field in the header of the binary
* book. However, during book building the following value
* is used.
*/
static final int MAX_DIGEST_BITS = 20;
static int digest_bits;
static int DIGEST_SIZE() { return (1 << digest_bits);}
static int DIGEST_MASK() { return (DIGEST_SIZE() - 1);}
So a smaller book size simply will not work without changes to the source also.
chessdev wrote:target size is under 20kb. all we really need is variety. maybe cutting off the book at 5 or 8 or 10 moves would work. even cutting off at 5 moves would yield thousands of possible games. smaller the better as it has to load in the browser.
/*
* We now allocate memory for the book dynamically,
* according to the size field in the header of the binary
* book. However, during book building the following value
* is used.
*/
static final int MAX_DIGEST_BITS = 20;
static int digest_bits;
static int DIGEST_SIZE() { return (1 << digest_bits);}
static int DIGEST_MASK() { return (DIGEST_SIZE() - 1);}
So a smaller book size simply will not work without changes to the source also.
chessdev wrote:target size is under 20kb. all we really need is variety. maybe cutting off the book at 5 or 8 or 10 moves would work. even cutting off at 5 moves would yield thousands of possible games. smaller the better as it has to load in the browser.
/*
* We now allocate memory for the book dynamically,
* according to the size field in the header of the binary
* book. However, during book building the following value
* is used.
*/
static final int MAX_DIGEST_BITS = 20;
static int digest_bits;
static int DIGEST_SIZE() { return (1 << digest_bits);}
static int DIGEST_MASK() { return (DIGEST_SIZE() - 1);}
So a smaller book size simply will not work without changes to the source also.
chessdev wrote:target size is under 20kb. all we really need is variety. maybe cutting off the book at 5 or 8 or 10 moves would work. even cutting off at 5 moves would yield thousands of possible games. smaller the better as it has to load in the browser.
/*
* We now allocate memory for the book dynamically,
* according to the size field in the header of the binary
* book. However, during book building the following value
* is used.
*/
static final int MAX_DIGEST_BITS = 20;
static int digest_bits;
static int DIGEST_SIZE() { return (1 << digest_bits);}
static int DIGEST_MASK() { return (DIGEST_SIZE() - 1);}
So a smaller book size simply will not work without changes to the source also.
thank you dan. i THINK i understand how this works. you take a .pgn and then do some kind of "makebook" command and specify how many ply to include and how many moves it must have in order to be counted.
unfortunately the file you sent was too large at 178kb. i'm trying to get 10% of that!
that just has short pgns in it for most openings. i would love it if you could cut it off at 10 ply, and try it with ONE and TWO move requirements (meaning that a move is only included in the "book" if it is played twice. that way i can see what each book size would come out as.
i REALLY appreciate your help. instead of payment in money, how about payment in free membership at chess.com?