[computer-go] Experiments with UCT

[Wang Yizao]

Rémi Coulom wrote:

>Wang Yizao wrote:
>  
>
>>No, I mean, essentially UCT is a determinist algorithm, but in our
>>program we have a stochastic part(for giving a score at each leaf).
>>    
>>
>
>That sounds strange. I don't understand. Can you explain more?
>
>Rémi
>_______________________________________________
>computer-go mailing list
>computer-go at computer-go.org
>http://www.computer-go.org/mailman/listinfo/computer-go/
>
>
>  
>
In short, let's suppose that the tree has depth 10, which is not the
case of Go for most of the time, and every simulation arrives the end
leaf( at depth 10), where the score given is determinist. In this case
UCT works pretty well I believe. The question is, in this case will it
be better than, for exemple, min-max tree search?

Yizao