>> MCTS using RAVE prioritization *does* converge to game theoretic values in a >> binary-valued space.
>Can you reference some more detailed analysis claiming this? Theorem: In a binary-valued game of finite length, the RAVE score of all winning moves converges to 1, provided that 0 < FPU < 1. I posted a proof in this forum a while back. It might have been before we switched providers. If you can't find the proof in the archives, you can prove it by induction on the length of the game.
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
