[computer-go] Explanation to MoGo paper wanted.

[Chris Fant]

> 2) If the playouts are too deterministic, and the moves are merely pretty
> good, the program may avoid an important move and thus misjudge the value of
> a position.

IMO, this is the most interesting part of Computer Go today.  How can
one possibly design an optimal playout agent when making a playout
agent that plays strong is not the solution?  The only known method
seems to be trial and error.