Hi!
I have changed my real life name to Øystein Schønning-Johansen. If the
system understand utf8, your can keep the ø's. If not, replace with Os.
(Maybe I should update the AUTHORS file as well)
Looking forward to use git.
-Ø
On Sun, 25 Feb 2024, 23:07 Philippe Michel,
wrote:
> W
Hi!
I'm asking for a friend, as the apple products really aren't my style.
Are there any builds of GNU Baclgammon for Mac avalable? or even iPad?
-Øystein
Thank you again for your effort. Really much appreciated.
Do you have the raw neural network weight files?
-Øystein
tir. 6. feb. 2024 kl. 08:13 skrev Philippe Michel :
> A new version of GNUbg is available at https://www.gnu.org/software/gnubg/
> with the following improvements or new features
:
> Thx!
>
> On Wed, Dec 27, 2023 at 7:20 PM Øystein Schønning-Johansen <
> oyste...@gmail.com> wrote:
>
>> The normal contact position neural network had 250 inputs, 128 hidden
>> nodes and 5 outputs.
>>
>> -Ø
>>
>> On Wed, 27 Dec 2023, 23:
The normal contact position neural network had 250 inputs, 128 hidden nodes
and 5 outputs.
-Ø
On Wed, 27 Dec 2023, 23:23 Mark Higgins, wrote:
> Can someone remind me pls - how many hidden nodes does the gnubg 0-ply bot
> use in its neural networks? Thx!
>
>
I've been thinking of a backgammon protocol the whole day now. Here are
some of my viewpoints.
As Guido says, both UCI and xboard are terrible, and I think they have some
weaknesses, yes. It is really hard to define a perfect protocol and it
cannot be perfect on the first attempt anyway. I think
For the first question "Is it possible to use GnuBG to test an own
implementation of a bot?", I would say yes, go ahead.
I actually think it will be very hard to implement a bot on your own
without having anything to verify against.
I have used GNU Backgammon to verify my own codes over the
g 2023 at 02:07, Øystein Schønning-Johansen <
> oyste...@gmail.com> wrote:
>
>> Yes!
>>
>> We could actually train neural networks with different characteristics.
>>
>> Let's say we do one loop through the training dataset, and for each
>> position
Yes!
We could actually train neural networks with different characteristics.
Let's say we do one loop through the training dataset, and for each
position we add a little notch to the winning probabilities for all
positions that have an opponent checker on the bar (and maybe even a bigger
notch
I think this is sad news. I have never been an XG user myself, but having a
commercial product available is important for the backgammon community
(even when an open source project exists).
I think the price indication of the IPR is a bit high. (I guess Xavier
reads this)
I'm estimating a bit.
tir. 3. jan. 2023 kl. 22:44 skrev Philippe Michel :
> This is not a core library approach either, but I think that in chess
> open source software they tend to use a similar approach, with a few GUI
> applications and many engines using a common communication protocol.
>
> That may be an
. Hopefully,
converting from CVS to git will attract new contributors to the project.
The question is: How is it best to do this?
I have already added the git feature on the project admin page, but the git
repo is (of course) still empty.
Best regards,
Øystein Schønning-Johansen
Maintainer
Happy new year to all!
I agree that converting from cvs to git is a good idea. However, GitHub as
the git repo provider may not be the best, and I think that should be
discussed. (I do love GitHub, and I use it for all my personal projects,
but there are some issues ... )
What I rather suggest
Mark!
I don't think building on Linux systems is really difficult. I rather
suggest that you try to build it from the source at your system, and then
start a new thread here if you get into trouble.
short (untested) sketch of what you need to do:
Get the source code:
Either
- CVS: cvs -z3
After a first browse and playing some games, I can say it looks very good!
I cannot see any glitches or bugs.
The only comment I have after playing two matches is that it rolls very
good dice for itself. It must be cheating! ;-)
-Øystein
man. 7. nov. 2022 kl. 22:26 skrev Øystein Schønning
Sounds promising, I'll give it a try now.
-Øystein
man. 7. nov. 2022 kl. 21:51 skrev Philippe Michel :
> I have uploaded a new gnubg Windows build at
> http://philippe.michel7.free.fr/gnubg/
>
> If not for a report of a serious issue I will use this version for a
> release next week.
>
> The
It's just an option for use with initial positions, such that the first
roll is never a double. Nice if you want to roll out a match equity table.
I'm not sure how it handle the turn, when this option is used. I think I
have to read the code to answer that.
-Ø
On Mon, Oct 17, 2022, 14:22
; WC2022 final, however, I think the problems are solvable.
>>>>>>
>>>>>> I've gathered the code in a github repository:
>>>>>> https://github.com/oysteijo/xgdatatools
>>>>>>
>>>>>> And just as I did that,
ev Øystein Schønning-Johansen <
oyste...@gmail.com>:
> Ha!
>
> Sorry for the late reply. Now that I actually have a Windows computer and
> some other postings on the list got me interested again; I finally
> downloaded this "dev" release. 20220703
>
> It looks
Ha!
Sorry for the late reply. Now that I actually have a Windows computer and
some other postings on the list got me interested again; I finally
downloaded this "dev" release. 20220703
It looks fine to me. I love the new !Score map! feature!
After playing a few games, I've not seen any glitches
>>
>> 32
>>
>> 0 (even)
>>
>> 50.0
>>
>> 50.0
>>
>> T-15
>>
>> 34
>>
>> 100
>>
>> 52.0
>>
>> 52.9
>>
>> T-17
>>
>> 36
>>
>> 200
>>
>> 54.0
>
Hmmm
If my archive remembers correctly there never was a jac200 table. I don't
have a copy of "Can a Fish Taste Twice as Good?", is it even a table in
that book? I find no file called jac200.xml in the CVS attic either. So if
there was a file called jac200,xml it must have been a local
has already
done the same 3 years ago:
https://github.com/zkitX/xgdatatools
-Øystein
fre. 12. aug. 2022 kl. 19:09 skrev Turker Eflanli :
> Here they are - I don't remember where I had downloaded them from
>
> On Fri, Aug 12, 2022 at 12:01 PM Øystein Schønning-Johansen <
> oys
Thank you so much, Turker!
However, it would still be good to have the Petch-tools. :-)
-Øystein
fre. 12. aug. 2022 kl. 16:58 skrev Turker Eflanli :
> Øystein,
>
> Find attached the raw file that you can analyze in GNU
>
> On Fri, Aug 12, 2022 at 10:12 AM Øystein Schønning-Joh
Hi!
I was thinking of analysing the WC 2022 final and found the final available
in .xg format.
I think Michael Petch wrote some tools to convert xg file into sgf format.
Are these tools available somewhere?
It states at: https://www.extremegammon.com/XGformat.aspx
that the python source for his
What about granting Aaron write access to the CVS?
-Ø
On Tue, Sep 14, 2021 at 8:37 AM Christian Anthon
wrote:
> The easiest way is to post the code on the gnubg bug tracker on savannah
>
> On Mon, 13 Sep 2021 at 08.29, Gnubg wrote:
>
>> Hi Aaron,
>>
>> I forward your e-mail to the list. You
Yeah!
Good points, Ian. Maybe it is possible to "reverse engineer" the
executable code of the potential clones and see if it matches the weights
of a neural network from GNU Backgammon. The weights of a neural network
will indeed be sequential in memory as in GNU Backgammon. This will be
strong
Absolutely true. I would love to see a web based graphic user interface for
the gnu backgammon engine. Say React or Angular or something
javascript-ish. (Non of these are my cup of tea)
-Øystein
On Wed, Dec 2, 2020, 21:16 Rich Heimlich wrote:
> There's one other big reality here and that's
No, you're not.
I agree with you that GNU is stronger than Snowie from what I see, but I
have never made any full analysis as I do not have an installation of
Snowie. Since I do not have a full analysis that compares the strength, I
cannot quantify the internal strength between them. You write
>
> Works fine from here (after I updated my very very old ssh keys anyway)
> are you sure you are on a network that allows ssh out?
>
I would strongly believe it allows since I can indeed ssh out to other
far-away computers.
I have even tried to create a new key-pair, but still no success. I can
Hi!
When I try to checkout the sources as a project member, savannah says the
network is unreachable,
[oystein@jupiter oystein]$ cvs -z3
-d:ext:oyste...@cvs.savannah.gnu.org:/sources/gnubg
co gnubg
connect to address 209.51.188.81: Connection timed out
Trying 2001:470:142::81...
On Mon, Oct 19, 2020 at 7:52 PM Joseph Heled wrote:
> I can comment on that: my experience from 20 years ago was that at some
> stage adding positions started to hurt the net performance. It is always a
> balancing act between getting the common/regular positions right and
> getting the edge
an evaluation, compare the higher-ply result with
> the 0-ply result and if the 0-ply errs by a large enough threshhold, add
> the position to the database.) If not, do you think it would be worth
> implementing this?
>
> Best regards, Aaron
> --
>
On Mon, Oct 19, 2020 at 3:10 PM Aaron Tikuisis
wrote:
> That is interesting, I did not realize that gnubg misplays race positions
> much. What are some examples?
>
Here is a position I posted a few weeks ago.
GNU Backgammon Position ID: 960BAMCw+0MAAA
Match ID :
On Mon, Oct 19, 2020 at 12:02 AM Joseph Heled wrote:
> But someone starting work in that area can take the old frame for another
> spin. They would learn a lot, even if they don't improve anything.
>
Yes! I can confirm that.
> They can start with the "relatively" low hanging fruit of the race
I must admit there isn't much happening at the moment. But if you do find
bugs or have ideas, feel free to post then here at the mailing list or use
the bugtracker at savannah. Of course there's no guarantee that the ideas
will be implemented or the bugs will be fixed. If you have a pull request
rker
>
> On Tue, Oct 13, 2020 at 8:51 AM Øystein Schønning-Johansen <
> oyste...@gmail.com> wrote:
>
>> Hi Turker!
>>
>> If you just want the CLI of gnubg on Windows 10, maybe you can use WSL 2?
>> It works pretty well, and I cannot imagine that GNU Backgamm
Hi Turker!
If you just want the CLI of gnubg on Windows 10, maybe you can use WSL 2?
It works pretty well, and I cannot imagine that GNU Backgammon will not be
able to compile under WSL 2.
-Øystein
On Tue, Oct 13, 2020 at 2:43 PM Turker Eflanli
wrote:
> Ok, thanks for the reply.
>
> On Tue,
:
> On Tue, Oct 06, 2020 at 09:59:20AM +0200, Øystein Schønning-Johansen wrote:
>
> > A huge onesided non-contact database like this will misplay a lot of
> > positions.
>
> Is it really that bad ?
>
> I thought that, as long as one does not use shortcuts like the
> --no-
estimates, so your argument is indeed valid. Thanks for
pointing that out.
-Øystein
On Tue, Oct 6, 2020 at 2:32 PM Timothy Y. Chow
wrote:
> Øystein Schønning-Johansen wrote:
>
> >> And again: You should not build such a one-sided database in the first
> >> place. You will
Hi,
Thanks for your bug report. Let me have a guess.
In file makebearoff.c lines 216ff:
216/* read distributions */
217
218iOffset = 2 * iOffset;
219
220nBytes = 2 * (nz + nzg);
221
222if (fseek(pfTmp, iOffset, SEEK_SET) < 0) {
223perror("fseek'ing
Thanks, I think you are spot on, Philippe. (And so i Theo)
Easy for me does not imply that it is easy for the neural network.
-Øystein
On Wed, Sep 23, 2020 at 10:27 PM Philippe Michel
wrote:
> On Wed, Sep 23, 2020 at 06:22:28PM +0200, Øystein Schønning-Johansen wrote:
>
> > I stro
win in 4 rolls for a gammon. Since O has
> 13 pieces left, this means O has to roll doubles in 3 of the next 4 rolls,
> which is about 4*(1/6)^3 ~ 1.85%.
>
> Ted
>
> On Wed, 23 Sep 2020, Øystein Schønning-Johansen wrote:
>
> > Hi all!
> > I'm trying to rollout
Hi all!
I'm trying to rollout a position as cubeless moneygame. I think I see a bug
in GNU Backgammon. So here is my position:
GNU Backgammon Position ID: 960BAMCw+0MAAA
Match ID : cAkA
+13-14-15-16-17-18--19-20-21-22-23-24-+ O: gnubg
| |
Hi again all!
I'm looking for the training data again, and I know that it used to be here:
http://files.gnubg.com/media/nn-training/pmichel/training_data/
It looks like it's not available anymore. Does anyone know where I can find
a copy of the data?
-Øystein
Hmmm... Peter? Can you check if this bug appears both when doing
multithreading as well as when running gnubg with a single thread?
-Øystein
On Wed, Aug 12, 2020 at 5:10 PM Christian Anthon
wrote:
> Definitely a bug of some kind. The dice generator either runs out
> prematurely or decides that
I've not tested, but could this be a problem at random.org? Maybe we should
start using their new JSON-RPC based API?
-Øystein
On Wed, Aug 12, 2020 at 10:40 AM Peter Lederer wrote:
> Hello Philippe,
>
> it happens consistently. Every time.
>
> My internet connection is flawless.
>
> If I
I've not seen that before, but from experience I've seen that a reboot is
what makes things work again. That is especially true when it comes to
display drivers on Linux systems. Have you tried that?
-Øystein
On Tue, Jan 21, 2020, 17:11 Mark Neidorff wrote:
> Hi,
>
>
>
> I (at last, but never
Thanks for your report.
The makebearoff code was written last millennium, and the problem you're
seeing is probably caused by some overflow problem in the code. These kind
of stuff was hard to check back in the 90s.
I guess it is fixable but ...
* Assuming you are able to solve the code issue
Hi!
As we discussed a bit last week I've started to think again. How can we
improve a backgammon engine?
I think that most of us agree that what can be improved is play in
positions where some kind of long term plan is needed. Like
"snake"-positions and backgames.
The reinforcement learning
No, the question is fair enough. You just have to apply the FIBS rating
formula when you have estimated a winning probability of the strongest
player.
-Ø
On Thu, Dec 5, 2019 at 11:02 PM Theodore Hwa
wrote:
> That's not really a fair question. The point is, both GNUBG/XG and a
> "perfect bot"
I have tried some experiments, and it looks like the training dataset (for
contact positions) with the current input features, do indeed like some of
the more modern methods. Briefly summarized:
Things that improves supervised learning on the dataset:
* Deeper nets, 5-6 hidden layers combined
But let's chat about the idea instead. What will it actually mean to 'apply
"AlphaZero methods" to backgammon.' ?
AlphaZero (and AlphaGo and Lc0 and SugaR NN) is just more or less the same
thing as reinforcement learning in backgammon. So, from my understanding,
it is rather AlphaZero, who has
Heled wrote:
> Like I said, installed from the standard Ubuntu rep.
>
> Yes, info says multithread support. It says SSE/SSE2 support. What
> about SSE3/4 etc, or they confer no real improvement over SSE2?
>
> -Joseph
>
> On Wed, 4 Dec 2019 at 09:58, Øystein Schønning-Johans
mon 1.06.002) and the rollouts speed seemed terrible.
>
> Do I need to do something in the GUI to enable multi-threading? (and I
> hope that by multi-threading we are talking about multi-core, not just
> threading, which does not help)
>
> -Joseph
>
> On Wed, 4 Dec 2019 at 09:38,
On Tue, Dec 3, 2019 at 7:37 PM Joseph Heled wrote:
> I am out of the loop too, but speeding up rollouts (i.e. using modern
> multicores) seems like a worthy improvement.
>
Isn't that done already?
I think the code is multithreaded using gthreads from glib. I think it was
done by Michael (and
Hi Sarah!
Thanks for taking contact. Good to hear that you like GNU Backgammon.
Is it still under development? Hmmm... debatable. There has not been many
major improvements the last few years.
Take a look at the projects ChangeLog.
> > On Wed, Nov 27, 2019 at 10:30:38AM +0100, Øystein Schønning-Johansen
> wrote:
> >
> > > I'm trying to download the training data from the site.
> > > http://files.gnubg.org/media/nn-training/
> > >
> > > Seems to me that the site does not respond.
Hi!
I'm trying to download the training data from the site.
http://files.gnubg.org/media/nn-training/
Seems to me that the site does not respond. What's happening? Have the site
been taken all down?
regards,
-Øystein
On Tue, Sep 24, 2019 at 10:09 PM Philippe Michel
wrote:
> Was OpenGL really the only issue ?
Probably not! (This is a good point, so thanks for pointing this out.) I
didn't try much, but I assumed that the OpenGL 3D board was among the
problems. I took one of the plain builds I had, I did not
Cool project. You have used emscripten to port the C code to webassembly?
Isn't there a port og GTK done with emscripten? Another way to port to web
would be to display the application itself with a different GTK backend.
I've tried that with the Broadway backend that can display GTK applications
Joseph Heled wrote:
> You have many independent runs, right? Why worry about multi-threading?
> Divide the set into (say) 16 threads (or whatever makes sense for your CPU)
> and run each set on another thread.
>
> -Joseph
>
> On Mon, 17 Jun 2019 at 19:28, Øystein Schønni
also only handle positions where gammon and backgammon
are not a subject. I can probably handle those separately.
-Øystein
On Sun, Jun 16, 2019 at 10:33 PM Philippe Michel
wrote:
> On Mon, Jun 10, 2019 at 02:49:26PM +0200, Øystein Schønning-Johansen wrote:
>
> > I will try re
Thanks,
I will try re-rolling out these positions. Do you have any experience of
how to do good rollouts of race positions? Good rollout settings for race
positions?
-Øystein
On Sun, Jun 9, 2019 at 11:38 PM Philippe Michel
wrote:
> On Fri, Jun 07, 2019 at 08:30:10PM +0200, Øystein Schønn
Hi, all!
Out of curiosity I've just started to look into the race datasets. I notice
something really strange.
I take all the positions from
http://files.gnubg.com/media/nn-training/pmichel/training_data/race-train-data.bz2
and from this I create a dataset for training.
Then I take all
On Thu, Jun 6, 2019 at 12:21 AM Philippe Michel
wrote:
> Interesting diagram. I suppose the hc_0 and hc_1 prefixes mean the
> inputs are for the player on roll and for the other respectively ?
>
Yes! hc is for "hand crafted" features, the cleaned dataset I used also
have features
prefixed by
Sorry the late answer, Philippe!
This is a really interesting find. I totally agree with you. The code that
calculates PIPLOSS is really unreadable and un-maintainable. Some years ago
I wrote a structure to hold the board state, and I then also had to adapt
the input calculation to this new board
It sounds like a really cool project. If you host it on github, and then
announce it to some friends, I pretty sure you will have volunteers.
-Øystein
On Thu, May 16, 2019 at 10:30 PM Joseph Heled wrote:
>
> Hi,
>
> (I know this is the wrong forum, but casting the net anyway)
>
> I am looking
OK, I've set up a private github repo of the twosided tools. State your
github profile name in a PM if you want access.
-Øystein
On Sun, Mar 24, 2019 at 5:14 PM Øystein Schønning-Johansen <
oyste...@gmail.com> wrote:
> On Sun, Mar 24, 2019 at 4:33 PM Philippe Michel
> wrote:
>
On Sun, Mar 24, 2019 at 4:33 PM Philippe Michel
wrote:
> On Sun, Mar 24, 2019 at 03:17:07PM +0100, Øystein Schønning-Johansen wrote:
> > Yes. Really cool. I have earlier seen significant differences between
> > one-sided and two-sided race evaluation, but this is not one of th
it by bittorrent, or the
generating code. The data file is 11 GB.
-Øystein
On Sun, 24 Mar 2019 15:00 Philippe Michel, wrote:
> On Thu, Mar 21, 2019 at 12:54:18PM +0100, Øystein Schønning-Johansen wrote:
>
> > Cubeless prob. of saving gammon: 0.129424
> > 16: 13/12 12/6 -> 0.913
I wrote a little tool some years ago, that calculate the "exact" value for
such racing position. It calculates the probabilities with a top-down
dynamic programming way and uses *-minimax algorithm to fill in the values
and prune useless moves.
It is really unusable in real life situation as the
I also believe this behavior is intentionally like this. I certainly do not
remember, but I think the best answer will be provided by Jørn.
On Sat, Feb 23, 2019 at 10:03 PM Philippe Michel
wrote:
> When choosing to play without doubling cube (in settings / options /
> cube), the following
with this property.
Josephs position also work, but it has to be the race leading player on
roll.
Thanks guys,
-Øystein
On Tue, Jan 29, 2019 at 9:46 PM Philippe Michel
wrote:
> On Tue, Jan 29, 2019 at 08:00:22PM +0100, Øystein Schønning-Johansen wrote:
> > Hi all!
> >
> >
Hi all!
Here is a theoretical question for all of you:
Can a race (aka. non-contact) position, be possible to lose backgammon with
a good dash of unluck, and still be possible to win (with a good dash of
luck). It is assumed that the player is really trying to get of the
backgammon, and plays
Thanks for your effort Philippe. Your numbers looks correct.
However, I think it is important to state some more details.
First: Are the games played to completion? Or are the games terminated at
race or bearoff or ...
Second: Does the pubeval evaluate all the position classes? I once did the
How does the paper report this? Does it take gammon and backgammons into
account (ie. cubeless moneygame) or does it just count win/loss ratio (ie.
like one-point-match) ?
-Øystein
On Tue, Jan 22, 2019 at 11:05 PM Robert Edgar wrote:
> Can anyone confirm the score of a recent version of gnubg
Hi, if you follow the link at the very end of this email (or any email from
the mailing list) you will find instructions on how to unsubscribe. If you
have any problems unsubscribe, please contact the mailing list admin. The
admin email address is also given at the linked web page.
Regards,
On Sat, Jul 28, 2018 at 10:27 AM Ralph Corderoy
wrote:
>
> Can we rewind a bit because the mailing list isn't privy to what's
> happened.
>
> Your first problem was the missing toolbar, so no New, Accept, Decline,
> Undo, etc., buttons, but the rest of the game was present and working?
>
Sorry
Hi again, Brenda.
Now I'm a bit more uncertain what cases your problem. I'm adding the
mailing list such that other users and developers may be able to help.
I think you have to describe what you do get this error message. Is it when
you start GNU Backgammon? From my hunch, I guess there is
Hmmm... can it be that you are playing in full screen mode?
Try hitting F11 or Esc.
-Øystein
On Sun, Jul 22, 2018 at 8:20 AM Brenda Langridge
wrote:
> I have been playing gnubg backgammon got quite a while now and really
> enjoy it. When I used to load it, I always got the tool bar. Now
>
> set xgid XGID=BBCA-AB-B--eB-:0:0:1:51:0:3:0:5:10
> move 24/19 18/17
> previous
> hint
>
> Perhaps it could be a clue. Not sure.
>
> Best regards,
> TP
>
>
> On Sat, Feb 17, 2018 at 1:05 PM, Øystein Schønning-Johansen
> <oyste...@gmail.co
ds,
> TP
>
>
>
>
> On Sat, Feb 17, 2018 at 11:44 AM, Øystein Schønning-Johansen
> <oyste...@gmail.com> wrote:
> > Really strange. However it is a heisenbug (of course). I cannot recreate
> the
> > bug on my system. (GNU Backgammon 1.06.000 Dec 13 2017, A
Really strange. However it is a heisenbug (of course). I cannot recreate
the bug on my system. (GNU Backgammon 1.06.000 Dec 13 2017, Arch Linux)
Here is how the same thing looks at my system:
GNU Backgammon Position ID: PgAAALYLBDMMAA
Match ID : cImmADAE
>
> Anyways, thanks a lot for the reply and sorry if I am getting you tired
> with this reply...
> Looking forward to your next reply :)
> Please tell me if this text looks ok like the first I sent so if not I can
> send a separate email. Thanks again :)
>
> *Sent:*
I really don't think Tim is suggesting this scheme, and I think he
absolutely understands flaws of the scheme.
Now the interesting part: How can you construct a scientific test to prove
(or falsify) the postulate that a software uses such scheme?
-Øystein
On Fri, Aug 25, 2017 at 10:44 PM,
Yes! These threads are funny! I'm not sure if I'm feeding a troll or not.
Who knows?
Mario: How do you think it cheats? What have you done to verify and prove
that it actually does cheat?
Can you describe your scientific method for your verification?
If you have not done any scientific study of
I also agree.
-Øystein
On 16 Aug 2017 10:21, "Ian Shaw" wrote:
I agree that it makes sense to reset the dice and cube.
-- Ian
-Original Message-
From: Bug-gnubg [mailto:bug-gnubg-bounces+ian.shaw=riverauto.co...@gnu.org]
On Behalf Of Philippe Michel
Sent: 14
Hi!
It's a long time since I browsed the GNU Backgammon code now. :-)
The rollout code in GNU Backgammon is of course threaded. How is this
threaded actually? Is it threaded on each sample (aka each game). One
thread pr. game? Or one thread pr. evaluation? Or?
I just wrote a code that does 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 position index 47:
Index: 47
0: 0
1: 0
2: 1/18
3: 445/648
4: 5939/23328
5: 73/23328
These numbers
Hi!
Do we consider the training data on the ftp site under any license, or do
we consider the training data public domain?
In case someone feel ownership to the data, please state your opinion.
Why I'm asking is because I guess we could try to upload the training
dataset to Kaggle, and maybe
Really old thread, but I now found out what to do, and how to make Gibbon
working on my system. (Arch Linux). Maybe I will make a PKGBUILD file for
it later.
Gibbon is depending on gsettings-desktop-schemas. Your system probably have
a deb/rpm/pacman for that.
gibbon comes with a .xml file.
Hi Robert!
I would love to see more development on the engine and the neural nets.
There are plenty of questions that could be asked when it comes to neural
net topology and training methods. However, from my point of view based on
my experience, I think the quality of a neural net evaluation
Hi,
I just noticed a bug. When setting the number of outputs to 5 or more, the
application crashes if I start a rollout. I think there is a buffer
overflow somewhere.
(No game) show version
GNU Backgammon 1.05.000 Apr 25 2015
Arch Linux from Arch/Community build!
-Øystein
H.
What about having a cache of each half board. If we calculate a (or keep a
running and updated) hash value for each half board. at entry of calculate
half inputs it checks the cache table. Of course this hash table can not
have many enteries, as it probably will have to store 125 float
I'm not sure this comment actually means that we should prefer a
programming language over an other. As Steve McConnell says in Code
Complete 2:
Program into your language. Not in it!
By this he mean abstraction to data types. What the GNU Backgammon code is
missing is real abstraction of
Let me make up the same program snippet with C++ syntax:
Board board = Board();
Evaluator* eval = new gnubg();
Dice roll = Dice( 3, 1);
Move best = eval-find_best_move( board, roll );
std::cout Best move is: best;
// I just made up this code based on the abstractions I listed in the
Hi!
I must admit that I'm not a big fan of C++ but at least it does not
make me sick (like Perl does).
I usually have problems seeing what you can gain from using C++ over C?
+ you get better abstraction with C++.
+ you get templates which may simplify some things.
+ you get operator
Hi!
A question mainly to Joseph: Did you ever run any move benchmarks on
the move selection algorithm for the one-side-rollout code?
-Øystein
___
Bug-gnubg mailing list
Bug-gnubg@gnu.org
https://lists.gnu.org/mailman/listinfo/bug-gnubg
Totally agree. SSE as a term is even architecture dependent. SIMD is not.
When the whole world has started using ARM processors, we have the
configure option --enable-simd=neon ready!
-Øystein
On Thu, Jun 20, 2013 at 9:47 PM, Michael Petch mpe...@gnubg.org wrote:
Howdy all,
Some may not be
1 - 100 of 141 matches
Mail list logo