On Mon, 5 Nov 2007, Jason House wrote:
I implemented this yesterday. In doing so, I realized I didn't know the
proper way to initialize new leaves in the UCT tree. MoGo papers seem to
talk about a progression from always picking an unexplored leaf (AKA using
infinity for the upper confidence
On Wed, 2007-11-07 at 14:34 -0800, Christoph Birk wrote:
What is the difference between 'hb-678-UCTRAVE-10k' and 'hb-675-UCT-10k'.
It's probably obvious, but UCTRAVE uses RAVE instead of just (tuned)
UCT.
___
computer-go mailing list
I'd like to implement RAVE as described in [1]. I believe I have a very
clear understanding of how to do this at the leaves of the UCT search tree.
What I'm not sure about is how to apply RAVE results higher in the UCT
tree. Does anyone have any experience with this that they're willing to
On Fri, 2 Nov 2007, Benjamin Teuber wrote:
I don't think there's something different at different depths in the tree..
To update RAVE after a simulation, for each child of a node you visited
during that simulation, you update if the move leading to the child was
played later (until the end of
I don't think there's something different at different depths in the tree..
To update RAVE after a simulation, for each child of a node you visited
during that simulation, you update if the move leading to the child was
played later (until the end of the playout).
Then, always when you calculate
I store it in the normal uct tree,
so that each node has variables raveVisits and raveWins besides uctVisits
and uctWins.
So a node in the UCT-DAG can either represent a position or a move.
On 11/2/07, Christoph Birk [EMAIL PROTECTED] wrote:
On Fri, 2 Nov 2007, Benjamin Teuber wrote:
I don't
