Perfect!
The very similar paper (by most of the same authors) "Adding expert
knowledge and exploration in Monte-Carlo Tree Search" contains the key
passage:
"In MoGo, the constant in front of the exploration term was not null
before the introduction of RAVE values in [10]; it is now 0."
Peter Drake
http://www.lclark.edu/~drake/
On Nov 9, 2009, at 10:31 AM, Petr Baudis wrote:
On Mon, Nov 09, 2009 at 10:18:25AM -0800, Peter Drake wrote:
I'm actually looking for something weaker than what Olivier has
offered: a published report of the empirical finding that (for some
programs, at least) an exploration coefficient of zero works best.
I think you could use "Combining expert, offline, transient and online
knowledge in Monte-Carlo exploration" for that, since there is
presented
an AMAF equation without any exploration term, and the final equation
has no exploration term either.
--
Petr "Pasky" Baudis
A lot of people have my books on their bookshelves.
That's the problem, they need to read them. -- Don Knuth
_______________________________________________
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/
