I am not good at term definition, but I would say RAVE is the algorithm
extending AMAF in MCTS, including how to accumulate the counts at each node
(trivial extension even though implementation can be tricky), how to
combine with UCT (or other move choice), and how to integrate with priors
(based
Petr Baudis wrote:
I wonder now, do you use separate set of gammas for simulations and
node
biasing? Since I've found that the performance seems very bad if I
don't
include some time-expensive features, since the gammas are then very
off; I will probably simply generate two gamma
Jacques Basaldúa wrote:
Petr Baudis wrote:
I wonder now, do you use separate set of gammas for simulations and
node
biasing? Since I've found that the performance seems very bad if I
don't
include some time-expensive features, since the gammas are then very
off; I will probably
Since patterns are correlated with each other, the gamma sets are
specific to the pattern set used. Since more patterns are used in the
tree, itrequires a separate set of gammas than the in-tree search.
Sent from my iPhone
On Dec 16, 2009, at 2:50 PM, Jacques Basaldúa jacq...@dybot.com
Oops, you're right. Here it is with -server:
Plug-and-Go refbot:17857
CRef bot (-O3) 12500
Gongo 1
Java bot: 1
CRef bot (no optimization) 5882
On Tue, Dec 15, 2009 at 1:40 PM, Mark Boon tesujisoftw...@gmail.com wrote:
The
That's pretty impressive for the go language if this is an apples to apples
comparison. Is it pretty much?
On Wed, Dec 16, 2009 at 9:50 PM, Brian Slesinsky br...@slesinsky.orgwrote:
Oops, you're right. Here it is with -server:
Plug-and-Go refbot:17857
CRef bot (-O3)
