[Computer-go] Congratulations to Erica!

Hideki Kato hideki_katoh at ybb.ne.jp
Tue Sep 7 05:38:12 PDT 2010

Sorry for my very rough description and thank you for the 


Olivier Teytaud: <AANLkTikyH9A9_n66osR9vvhK6C0MKxMYU9_i9wxBEeRD at mail.gmail.com>:
>> I'd like to know both numbers, Pasky.  BTW, does pachi use root
>> parallelisation on the cluster, ie, the same as of MoGo, Fuego
>> and MFG?
>In MoGo it's not root parallelization. We share the statistics in the tree,
>e.g. once per second (depending on the time settings);
>more precisely, we average
>- the number of wins,
>- the number of losses,
>- the number of amaf-wins
>- the number of amaf-losses
>in all nodes in the tree with more than e.g. 5% of the number of simulations
>at the root.
>This is not so different from averaging just at the root, but there's a
>slight improvement.
> (the difference is probably much higher when building strategies, as in
>opening book building, instead of just choosing one move)
>It is, on the other hand, much better than averaging just before taking the
>decision (i.e., roughly speaking, voting) as proposed in some papers.
>More details in http://hal.inria.fr/inria-00512854/.
>Best regards,
>---- inline file
>Computer-go mailing list
>Computer-go at dvandva.org
Hideki Kato <mailto:hideki_katoh at ybb.ne.jp>

More information about the Computer-go mailing list