[Computer-go] David Wilson's "All Critical Moves As First"

Olivier Teytaud teytaud at lri.fr
Mon Nov 14 16:19:10 PST 2011


The top of page 4 in this paper is very clear - yes, pure Monte-Carlo (no
tree search!)
is optimal for these random-turn games.

 Impressive... The proof is simple, but it is
so unexpected that one can work 20 years on such games without observing
this I guess :-)

Best regards,
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://computer-go.org/pipermail/computer-go/attachments/20111115/8e28a6c7/attachment.html>

More information about the Computer-go mailing list