Nothing to apologize over!
I probably should have put some kind of column headings or something.
I thought it more useful to be a count-down timer - it's much easier to
calculate how much time you took by subtraction with the previous entry
than it is to see how much time is left by adding up ev
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
share?
On 10/29/07, Christoph Birk <[EMAIL PROTECTED]> wrote:
>
> On Oct 29, 2007, at 8:39 AM, Jason House wrote:
> > For all of us in the bot-making kiddie pool, it's exceptionally
> > helpful to have reference implementations of basic algorithms
> > running on the server. When playing with AMAF, I foun
On Thu, Nov 01, 2007 at 08:57:38PM -0400, Joshua Shriver wrote:
> In that case I stand happily corrected. I once was going to release
> and one of the stipulations what that it had to be reassigned to the
> FSF. Couldn't remember if it was sourceforge, gnu, or what...
GNU Go has this requirement.
It appears that CGOS (9x9) is down.
Christoph
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
Hi Don,
Too much apologize is a (well known :-) Japanese culture or custom.
Please never mind.
I agree that the remaining time is more useful than the elapsed time
of a move and, also, some kind of explanation is much helpful.
Anyway, thank you for such a nice improvement. It's very useful f
I am trying to make a description of all steps required. But
it still doesn't work. So please, say what am I doing wrong.
1. Get TCL. There are many "flavors" with GUI, debugger etc.
The simplest, when you just need to run a Tk application
is something like:
http://www.equi4.com/pub/tk/tc
Hi,
Interesting paper, in case you did not notice:
http://www.machinelearning.org/proceedings/icml2007/papers/394.pdf
Title: Learning to solve game trees
Authors: David Stern, Ralf Herbrich, Thore Graepel
Abstract: We apply probability theory to the task of proving whether a
goal can be achie
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 the
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 th
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 d
11 matches
Mail list logo
