[computer-go] .. if Monte-Carlo programs would play infinitestrong

[Shunsuke SOEDA]

> > Eeh, am I missing some point here or would not any Go program that uses
> > search and infinite computer power "simply" SOLVE the game - given that
> > scoring is done right and infinite loops are ruled out?
> >
> The question should be more precisley stated as: Is playing strength a
> strictly-monoton increasing and unlimited function of computing power. But I
> thought the meaning of the question was clear.

Considering simple Monte Carlo approach to 9x9 Go, the answer to this
question is, No.

Experiments made by Yoshimoto showed that dimishing returns could be seen
when adding samples. It is described in the following article:
Haruhiro Yoshimoto, Kazuki Yoshizoe, Tomoyuki Kaneko, Akihiro
Kishimoto, and Kenjiro Taura: Monte Carlo Go Has a Way to Go,
Twenty-First National Conference on Artificial Intelligence (AAAI-06),
pages 1070-1075, 2006

The paper could be found at the following location:
http://www.fun.ac.jp/~kishi/publication.html
-- 
 Shunsuke SOEDA