Petr Baudis wrote:
Hi!
On Thu, Oct 01, 2009 at 11:37:06AM +0200, Rémi Coulom wrote:
I have been receiving a lot of questions about MM recently, so I
have just updated my web page:
http://remi.coulom.free.fr/Amsterdam2007/
You'll find the ICGA Journal version of my paper there, with more
Even a comparison against the java refbot's performance would be good.
IIRC, my D port of the java refbot was within about 1%
Sent from my iPhone
On Dec 13, 2009, at 12:01 AM, Brian Slesinsky br...@slesinsky.org
wrote:
I'd like to, but I can't find it. Where do I download it?
2009/12/12
On Sun, Dec 13, 2009 at 12:15:42PM +0100, Rémi Coulom wrote:
If I understand correctly, you are refering to that loop:
for (int i = Max; --i = Min;)
It starts at Max - 1, not Max.
I am pretty confident this part is correct. Otherwise, it would have
generated obvious errors.
Oh, I'm
I know this is a simple issue but I'm not sure of the solution. I am
currently in the very early stages of writing a go engine. I have the board
state and simple opening library implemented (no play logic yet). I'm would
like to output debugging/developnent output statements to the gogui shell
2009/12/13 Petr Baudis pa...@ucw.cz:
On Sun, Dec 13, 2009 at 12:15:42PM +0100, Rémi Coulom wrote:
If I understand correctly, you are refering to that loop:
for (int i = Max; --i = Min;)
It starts at Max - 1, not Max.
I am pretty confident this part is correct. Otherwise, it would have
On Dec 13, 2009, at 9:38 AM, Corey Harris charri...@gmail.com wrote:
I know this is a simple issue but I'm not sure of the solution. I am
currently in the very early stages of writing a go engine. I have
the board state and simple opening library implemented (no play
logic yet). I'm would
Was looking for a basic UCT data structure. I guess a tree structure is
created in memory. How is this managed, because memory can be exausted
pretty fast.
• record results for all visited
nodes___
Where do you record the results?
I appologize for the
• record results for all visited
nodes___
Where do you record the results?
In each node, you keep the statistics of simulations in this node. Many
informations can be useless in each node: rave values (the gellysilver
paper I've emailed to you)
I like standard references bots a lot :) I think they are very usefull for
promoting computer-go, and helping new comers. It gives a very good base for
confidence in a new implementation from a new comer :) So it would certainly be
usefull, if people could agree on a reference monte carlo
Javabot is at about 6.5k but they're not really comparable anymore,
because I added an array to keep track of the liberties for each
point.
On Sun, Dec 13, 2009 at 5:15 AM, Jason House
jason.james.ho...@gmail.com wrote:
Even a comparison against the java refbot's performance would be good. IIRC,
On Sun, Dec 13, 2009 at 07:08:54PM +0100, Denis fidaali wrote:
2/ If parent.visit 1000, pick a move according to UCT policy, if
parent.visit=1000 pick up a move with light playout policy.
This is a curious rule, does any actual existing bot use a rule like
this? It seems immensely
On Dec 13, 2009, at 11:30 AM, Corey Harris charri...@gmail.com wrote:
Was looking for a basic UCT data structure. I guess a tree structure
is created in memory. How is this managed, because memory can be
exausted pretty fast.
It isn't as fast as you might think. You want to use zobrist
On Dec 13, 2009, at 8:08 AM, Denis fidaali wrote:
So it would certainly be usefull, if people could agree on a reference monte
carlo tree bot (and provide some reference implementations in popular
langages).
It would obviously be based on the reference light-bot.
This is what I
Javabot is at about 6.5k but they're not really comparable anymore,
because I added an array to keep track of the liberties for each
point.
Do you mean you added the array to Gongo or to the java version? I.e. is
Gongo twice as quick as the java version because the java version is
doing more,
Many Faces keeps the tree from move to move. I discard nodes with few visits
(or old nodes) after each move to free up most of the tree memory, but I keep
the core of the tree. When MF runs out of memory it garbage collects some
nodes.
David
From: computer-go-boun...@computer-go.org
On Sun, Dec 13, 2009 at 2:56 PM, Darren Cook dar...@dcook.org wrote:
Do you mean you added the array to Gongo or to the java version? I.e. is
Gongo twice as quick as the java version because the java version is
doing more, or twice as quick even though it is also doing more?
Gongo is faster
On Sun, Dec 13, 2009 at 10:30:13AM -0600, Corey Harris wrote:
Was looking for a basic UCT data structure. I guess a tree structure is
created in memory. How is this managed, because memory can be exausted
pretty fast.
In Pachi, I don't manage memory at all, I simply hope it won't run out;
if
I probably won't have time to look at it much, but it would be good to
have another Java refbot to compare against. I did look at Plug-and-Go
but the install seems a bit tricky since I don't use Eclipse or
Spring. Ideally, each engine should compile to a jar file that
provides a GTP interface when
18 matches
Mail list logo
