I noticed this in the Changelog from 2007: Thu Apr 26 23:52:57 CEST 2007 Christian Anthon <address@hidden> * gtkbearoff.c, gtkbearoff.h, Makefile.am, backgammon.h, bearoff.c, bearoff.h, eval.c, eval.
Such tool is quite simple to make, however I would have defined the order of board points the other way. With some few files I have derived from GNU Backgammon, I where able to make such tool in abou
Strange, I get different values for the ones I generated myself (Win95, current CVS): makebearoff -o 6 -s 7999999 -f gnubg_os0.bd makebearoff -t 6x6 -f gnubg_ts0.bd -s 7000000 J:\_Projects\gnubg>md5s
No, I changed some stuff in makebearoff around December 9, which (marginally) changes the generated database BTW, I do not agree with the MD5 checksums for the two sided databsaes on Nardy's URL
This is on the TODO list already, but noone seems to work on it. An interesting side note is that Hugh Sconyers has offered to let us use some of his bear-off databases (I assume he means that we can
Well, as long as the discussion of the day is the bot’s development, I’ll take advantage and pass on the result of a long discussion I had with Kazaross at GG. We were discussing GNUbg in
Is it possible yet to generate a database larger than 11 chequers on six points? IIRC, the problem is that the pointer into the database file is a 32 bit integer, limiting the number of positions tha
Oops - it was a bit too loose as an estimate. I was just looking for a conservative upper bound on useful entries where the probability is being represented in 16 bits. I was mostly looking at the 32
I have ported Joseph's OSR code to a local copy of gnubg, but I never got around testing it. It's fairly simple to extend the current one sided bear-off database up to at least 10 points. It takes ar
In HeuristicBearoff(), around line 160-180 of bearoff.c. Why is a n value computed in the first loops then discarded by the "for ( n = -1; ... )" without ever having been used ?
One-sided enumeration: Assume you have C chequers and P points. The total number of one-sided positions is binom(C+P,P). 000...0000 : #0 100...0000 : #1 010...0000 : #2 001 ..0000 : #2 000...0001 : #
Hello, I just wanted to use bearoffdump.exe. Can anyone tell me how the positions are numerated within the bearoff databases. When i want to look for a special position´s output, how can i calculate
Both of these are wrong... The file sizes are correct. You can download correct files from: <URL:ftp://alpha.gnu.org/pub/gnu/gnubg> Has anyone else tried to generate bearoff files under win95? Jørn
<URL: http://users.skynet.be/bk228456/Obtaining-bearoff-databases.html > lists MD5 checksums for several bearoff databases. The value for gnubg_os0.bd corresponds with the one I have on disk, but the
Just out of curiosity, how exactly are the positions coded in the databases? The reason I ask, is that it seems obvious that the most economical manner possible is what is sought after and would be t
Is it really that bad ? I thought that, as long as one does not use shortcuts like the --no-gammons and --normal-dist options, one-sided databases were very accurate. Is it because the probabilites a
Really strange! I have built a one sided database using GMP with fractions with my own piece of code. Since I use fractions from GMP there should be no rounding error. Here are my numbers for positi