Makebearoff terminated before reaching the end of the 13 point database. One-sided database: Number of points : 13 Number of chequers : 15 Number of positions : 37442160 Approximate by normal distrib
Hmm, with line endings converted it's: -rwxrwxrwx 1 Administ Kein 9630656 Nov 27 18:13 br1.c It's not exactly the same. The definition of the array starts in line 31, the closing brace is in line 185
Looks fine. I've: -rw-r--r-- 1 jth jth 9529134 Nov 27 17:40 br1.c The difference is 101522 bytes. I would expect a difference equal to the number of lines (which is 183288 on my box). I'll add some c
Hello all I'd like very much to have the following information: (1) What is GNUbg's formula for calculating "EPC"/"Trice count" of bearoff positions? (2) Is that formula, or any approximation thereo
To site a danish gruk of Piet Hein, Den som kun tar spøg for spøg og alvor kun alvorligt Han og hun har faktisk fattet begge dele dårligt. And yes something would be lost in translation, but Øyst
At first I tought your message was kind of a joke, however I guess there are some features that could have such asserts(), for sure. I'll try to think of some.... Taking this this gammon/bearoff thin
Hi! I have installed the windows 0.15 stable version of gnubg from the install archive on this page http://www.gnubg.org/index.php?itemid=56. During the installation I was not asked if I wanted to in
sgfl.c is autogenerated by lex from sgf.l. The version generated by flex 2.5.4 seems to be unfit for HP-UX 11.0. Consider regenerating it: flex -osgfl.c -Psgf ./sgf.l I'm not sure what you mean by th
As an FYI, i have compiled gnubg 0.14.2 on HP-UX 11.0. i compiled gnubg using gcc 2.95. i am playing right now and it works great. congrats on the fine software. however, there were a few issues duri
I thought eq(cfully live cube) would not be "easy". In principle it is. For match play it's explicitly calculated by the Cl2CfMatch-family of functions. However, for money play Cl2CfMoney uses Janow
and what the At http://users.skynet.be/bk228456/GNUBgW.htm you will find: - 1-sided bearoff db and 2-sided bearoff db (making gnubg.bd superfluous) - new weights (0.12a) At http://users.skynet.be/bk2
So far I've tried the posted matches and have been able to play out the games without incident. I've not looked at the code, so this could be wildly wrong, but all the reports of make doing odd thing
Since it crashes on race positions there might be a problem with the new bearoff databases (gnubg uses bearoff databases for calculating bg chances; also multiple ply may reach bearoffdatabase). Has
The circular dependencies aren't really a problem. They are a result of a vastly different Makefile style. I think it's assuming every .o file in OBJS is dependant on every C and h file in SOURCE, wh
For a neural net this is not so clear. With 7 men stacked on the 7 point this is a position that will never happen in real play and is unlikely in training. Neither will its immediate continuations.
For a neural net this is not so clear. With 7 men stacked on the 7 point this is a position that will never happen in real play and is unlikely in training. Neither will its immediate continuations.
The position is of a kind that was probably not common in the racing neural net training database. X's formation just doesn't happen in real play, does it ? GNU Backgammon Position ID: 2wUAAAb3O
The position is of a kind that was probably not common in the racing neural net training database. X's formation just doesn't happen in real play, does it ? GNU Backgammon Position ID: 2wUAAAb3OwgAAA
It seems to me, that where exact figures are there that must apply based on the score and cube value, as in this position, they reaaly should be used. -- Original Message -- From: Michael Petch To: N
Because Gnugb plays based on the score and cube value (When in Match play). When it evaluates it doesn’t blindly use the 2 sided bearoffdatabase because the static values the 2 sided database