Thanks Hiroshi. Most of the paper is available on google books:
http://books.google.fr/books?id=52kqBAAAQBAJ&pg=PA26#v=onepage&q&f=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, 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 Simon Viennot, CG2013
UCB is like this.
UCB = w/n + C * sqrt( log(N) / n );
RAVE = Rw/Rn + C * sqrt( log(N*175) / (N*0.48) );
beta = Rn / (Rn + n * (W1 + W2 * Rn));
UCB_RAVE = beta*RAVE + (1-beta)*UCB + G*log(1+gamma)*sqrt( K / (K + n));
n : child nodes
w : child wins
Rn: child nodes (Rave)
Rw: child wins (Rave)
N : sum of children's nodes
gamma : child gamma from MM
C = 0.31
W1 = (1.0 / 0.9)
W2 = (1.0 / 20000)
K = 600
G = 0.01
Regards,
Hiroshi Yamashita
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
_______________________________________________
Computer-go mailing list
[email protected]
http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
