It really pays when checking out an idea to be persistent and patient. You usually don't get it right the first time if it's very complex or interesting.
- Don On Mon, 2007-06-25 at 19:31 +0200, Sylvain Gelly wrote: > Hi, > > > In the paper you only present results of UCT_RAVE with the > MoGo > default policy. Did you run tests with UCT_RAVE using "pure" > random > playouts too? > > Yes we did, and the improvement was also huge, but I don't remember > the exact results. > > > I'm curious because I've tried millions ( well, it feels that > way ) of > uses for AMAF in my code... but so far all of them have been > proven > useless, often yielding worse results. > > I have to admit that it took me several weeks to make the RAVE > algorithm actually work, although the idea is so simple. That maybe > explain your previous results. > The description in the paper should be sufficient to make it work > well. > > Hoping this helps, > Sylvain > _______________________________________________ > computer-go mailing list > [email protected] > http://www.computer-go.org/mailman/listinfo/computer-go/ _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
