-go.org
Sent: Wed, 3 Dec 2008 12:56 am
Subject: Re: [computer-go] Monte-Carlo Tree Search reference bot
Hmm.. it could be that N is picked randomly each time... now I can't seem to
find the description and my memory is not serving me well here. Perhaps someone
else remembers? I'll try to track
-Original Message-
From: Mark Boon [EMAIL PROTECTED]
To: computer-go computer-go@computer-go.org
Sent: Tue, 2 Dec 2008 11:17 pm
Subject: Re: [computer-go] Monte-Carlo Tree Search reference bot
I have made some minor performance improvements and this is as far as I
intend to take
On Wed, Dec 3, 2008 at 05:17, Mark Boon [EMAIL PROTECTED] wrote:
I had set myself as an arbitrary goal that it should do at least 20K
playouts. But with real liberties, AMAF and a RAVE formula I got stuck in
the 16K-17K range. According to my profiler that is mostly due to the
expensive
On 3-dec-08, at 06:09, Sylvain Gelly wrote:
What I did (was a long time ago, I don't know if it is still used in
Mogo), is to compute the m best moves every so often and most of the
time just do the max over those m moves.
m was on the order of 5, and every so often was an increasing
function
On Wed, Dec 03, 2008 at 09:55:07AM -0200, Mark Boon wrote:
I thought about that, but I was afraid the code would become too
obscure. After all, this is supposed to be a reference
implementation. But maybe I should actually give it a try to see what
it would look like.
I agree that the
On 3-dec-08, at 10:31, Heikki Levanto wrote:
Having said that, I can't help responding to one detail:
I had seen people write about memory usage of the tree, but never
understood the concerns.
One thing to remember is that more memory use means more cache
misses, and
more access to the
On Wed, Dec 03, 2008 at 11:24:22AM -0200, Mark Boon wrote:
Heikki wrote:
One thing to remember is that more memory use means more cache misses,
and more access to the main memory. On modern computers, those can cost
as much as executing a thousand instructions! So memory optimizing can
I had a chess program years ago that was blindingly fast on some
computers, very slow on others. It was all about the cache. The move
generator was hard coded for each piece on each square. For instance a
white pawn on d7 had it's very own move specialized move generator.
There was a function
On Wed, 2008-12-03 at 11:24 -0200, Mark Boon wrote:
If this is because I use Java, then
Don's concise C implementation of the MC-AMAF bot should be a lot
faster than my bloated Java version.
I don't remember the numbers, but my own java and C implementation were
written in the same style -
I have made some minor performance improvements and this is as far as
I intend to take this particular project. I might make some small
changes if necessary, but most likely I'll leave this largely
unchanged from now.
I had set myself as an arbitrary goal that it should do at least 20K
or 10 or so), just
repeat that move without having to calculate what the move would be.
- Dave Hillis
-Original Message-
From: Mark Boon [EMAIL PROTECTED]
To: computer-go computer-go@computer-go.org
Sent: Tue, 2 Dec 2008 11:17 pm
Subject: Re: [computer-go] Monte-Carlo Tree Search reference
the move would be.
- Dave Hillis
-Original Message-
From: Mark Boon [EMAIL PROTECTED]
To: computer-go computer-go@computer-go.org
Sent: Tue, 2 Dec 2008 11:17 pm
Subject: Re: [computer-go] Monte-Carlo Tree Search reference bot
I have made some minor performance improvements and this is as far
]
To: computer-go computer-go@computer-go.org
Sent: Wed, 3 Dec 2008 12:14 am
Subject: Re: [computer-go] Monte-Carlo Tree Search reference bot
That's going to repeat the same exact path through the tree three times, isn't
it? If so, it seems like it would be more efficient to do N playouts from the
leaf after
results. It makes assertions
reproducibles, and that's really great.
From: [EMAIL PROTECTED]
Subject: Re: [computer-go] Monte-Carlo Tree Search reference bot
Date: Fri, 28 Nov 2008 01:48:09 -0200
To: computer-go@computer-go.org
CC:
On 27-nov-08, at 19:50, Denis fidaali wrote:
So, you
, and the experimental results. It makes
assertions
reproducibles, and that's really great.
From: [EMAIL PROTECTED]
Subject: Re: [computer-go] Monte-Carlo Tree Search reference bot
Date: Fri, 28 Nov 2008 01:48:09 -0200
To: computer-go@computer-go.org
CC:
On 27-nov-08, at 19:50, Denis fidaali
I have added a MCTS implementation to my reference-bot project. It
allows you to specify how many nodes to search, after how many nodes
to expand and whether to use AMAF or not. If you specify the number
of nodes before expansion to be the same as the total number of nodes
to search and
of the
AMAF version. If you don't, i would think that something
is wrong somewhere.
What test process do you use for this version ?
From: [EMAIL PROTECTED]
Date: Thu, 27 Nov 2008 18:15:34 -0200
To: computer-go@computer-go.org
CC:
Subject: [computer-go] Monte-Carlo Tree Search reference bot
17 matches
Mail list logo
