[Computer-go] 7.0 Komi and weird deep search result

Petr Baudis pasky at ucw.cz
Sun Apr 3 19:53:34 PDT 2011

On Sun, Apr 03, 2011 at 04:21:10PM -0400, Brian Sheppard wrote:
> >AIUI, RAVE without special modifications (like those done in Mogo later)
> > does not have any convergence guarantees either.
> MCTS using RAVE prioritization *does* converge to game theoretic values in a
> binary-valued space.

I do not think this is true, at least for the general space of
simulation functions, as they may entirely shun the winning move.
Can you reference some more detailed analysis claiming this?

				Petr "Pasky" Baudis
UNIX is user friendly, it's just picky about who its friends are.

More information about the Computer-go mailing list