>
>
> David
>
>
>
> *From:* computer-go-boun...@computer-go.org [mailto:
> computer-go-boun...@computer-go.org] *On Behalf Of *Corey Harris
> *Sent:* Monday, December 14, 2009 5:34 AM
>
> *To:* computer-go
> *Subject:* Re: [computer-go] Simple gogui problem
>
>
>
-go.org] On Behalf Of Corey Harris
Sent: Monday, December 14, 2009 5:34 AM
To: computer-go
Subject: Re: [computer-go] Simple gogui problem
Is it possible to just use a hash table (no tree) and just update the hash
entry's node? Advantages/disadvantages of this approach?
On Sun, Dec 13, 2009
Is it possible to just use a hash table (no tree) and just update the hash
entry's node? Advantages/disadvantages of this approach?
On Sun, Dec 13, 2009 at 10:30 AM, Corey Harris wrote:
> Was looking for a basic UCT data structure. I guess a tree structure is
> created in memory. How is this man
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
[mailto:computer-go-boun...@computer-go.org] On Behalf Of Jason House
Sent: Sunday, December 13, 2009 12:27 PM
To: computer-go
Subject: Re: [computer-go] Simple gogui problem
On Dec 13, 2009, at 11:30 AM, Corey Harris wrote:
Was looking for a basic UCT data structure. I guess a tree
On Dec 13, 2009, at 11:30 AM, 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.
It isn't as fast as you might think. You want to use zobrist hashing
for looking
> >>• 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 gelly&silver
paper I've emailed to
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 th
On Dec 13, 2009, at 9:38 AM, Corey Harris 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 like to output debug
