[computer-go] Explanation to MoGo paper wanted.

[George Dahl]

On 7/5/07, Chris Fant <chrisfant at gmail.com> wrote:
> > 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.
> ______________________________________________

Make a playout agent that is just the "collapsed" knowledge of the
full program with uniformly random playouts.  This is what I am
working on right now.
-George