Delayed congratulations to AyaMC, winner of last Sunday's KGS bot
tournament, with 12 wins from 12 games!
My report, which says nothing about the games themselves, is at
http://www.weddslist.com/kgs/past/107/index.html
My thanks to Hideki Kato, for pointing out an error in the table
of annual
Delayed congratulations to AyaMC, winner of last Sunday's KGS bot
Thank you for the tournament and report, Nick!
Recently I got +100 Elo from selfplay by adding static bonus in UCB.
I used Ikeda's paper method.
Effciency of Static Knowledge Bias in Monte-Carlo Tree Search
Kokolo Ikeda and
Hi Hiroshi,
Why do you call it a static bonus?
If n increases with the number of simulations, the effect of the bonus term
still fades away.
Perhaps the interesting part is in fading out more slowly than with
ordinary priors (i.e., by 1/sqrt(n) instead of 1/n)?
BR,
Erik
BTW Nicks original
Thanks Hiroshi. Most of the paper is available on google books:
http://books.google.fr/books?id=52kqBAAAQBAJpg=PA26#v=onepageqf=false
Rémi
On 22/11/2014 18:53, Hiroshi Yamashita wrote:
Delayed congratulations to AyaMC, winner of last Sunday's KGS bot
Thank you for the tournament and report,
Sometimes the top move gets 99% or even 99.9% of the playouts, even
though it's not clearly the best move. It might actually be a big
mistake, but better moves were unlucky in the few playouts they got
and were never reconsidered.
I've found myself wishing for something similar to Ingo's
Hi Erik,
Perhaps the interesting part is in fading out more slowly than with
ordinary priors (i.e., by 1/sqrt(n) instead of 1/n)?
I agree with that.
My experiment are as follows.
In 1400 playouts, result is not good.
In 1 and 2 playouts, it seems bigger G is better.
I guess fading out
Hi Hiroshi,
I would interpret your results as K=600 is to big,
Detlef
P.s. this would be consistent with my results
Am Sonntag, den 23.11.2014, 10:20 +0900 schrieb Hiroshi Yamashita:
Hi Erik,
Perhaps the interesting part is in fading out more slowly than with
ordinary priors (i.e., by
