[computer-go] Monte Carlo combined with minimax search

[Rémi Coulom]

Peter Drake wrote:
> One thing I'm going to try next is counting the score not as sum(own(p)) 
> but as sum(signum(own(p))).  This way, it would be more interested in 

Do you mean signum(sum(own(p))) ?

> scoring points than in strengthening its hold on points it already has.  
> Of course, ideally there would be a continuum between these two, where 
> the program would become more conservative when it was ahead.

I am not sure that a continuum would be better than using the 
probability of winning all the time. At least, I am certain that using 
the probability of winning all the time is much better than using 
expected territory all the time.

Rémi