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

Michael Williams michaelwilliams75 at gmail.com
Mon Apr 4 05:01:22 PDT 2011


Yeah.  As N goes to infinity, MCTS+RAVE goes to MCTS.  So it sems like it
would be guaranteed to converge only if you had an exploration term in the
MCTS.



On Sun, Apr 3, 2011 at 10:53 PM, Petr Baudis <pasky at ucw.cz> wrote:

> 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.
> _______________________________________________
> Computer-go mailing list
> Computer-go at dvandva.org
> http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://computer-go.org/pipermail/computer-go/attachments/20110404/b3197474/attachment.html>


More information about the Computer-go mailing list