[computer-go] Monte-Carlo Go Misnomer?

[David Doshay]

On 3, Feb 2007, at 2:51 AM, Sylvain Gelly wrote:

> the speed of the best simulation policy in MoGo is 0.6 * the speed  
> of the uniform random one.

I think that this is very good. You give up less than a factor of 2  
from uniform random and you probably get better than a factor of 2 in  
the % of relevant moves.

This has been the biggest reason we have delayed adding MC to SlugGo:  
how do you keep the "randomly" selected moves anywhere near the  
relevant moves? With the high branching factor we face in Go, this  
seems most important to me. And MoGo has made huge strides in that  
direction.



Cheers,
David