Hi, I have a question about RAVE.
For example, there are 5 moves a,b,c,d,e. Black to play. In playout, Black plays "a", White plays "b", Black plays "c", W plays "d" and B plays "e". Then game is over, result is B win. B:a W:b B:c W:d B:e ... B win, result = +1 I update only B moves RAVE, like this. RAVEcount(a) += 1, RAVEwins(a) += 1 RAVEcount(c) += 1, RAVEwins(c) += 1 RAVEcount(e) += 1, RAVEwins(e) += 1 But on Sylvain's paper Figure4, It looks like updating all moves Black and White, like this. RAVEcount(a) += 1, RAVEwins(a) += 1 RAVEcount(c) += 1, RAVEwins(c) += 1 RAVEcount(e) += 1, RAVEwins(e) += 1 RAVEcount(b) += 1, RAVEwins(b) += 1 RAVEcount(d) += 1, RAVEwins(d) += 1 Is this right RAVE? I have misunderstood long time. Sylvain Gelly, David Silver. Monte-Carlo Tree Search and Rapid Action Value Estimation in Computer Go http://www.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/mcrave.pdf Regards, Hiroshi Yamashita _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
