[computer-go] Experiments with UCT

[Rémi Coulom]

sylvain.gelly at m4x.org wrote:
> Le Mercredi 26 Juillet 2006 14:23, Rémi Coulom a écrit :
>> Wang Yizao wrote:
>>> 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
>>> 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
> 
>> This being said, I still don't understand how your question is related
>> to mine.
> 
> Hello,
> 
> if I can come in this exchange, perhaps an answer to your question is that at 
> each leaf there is a random simulation until the end so here is the 
> stochastic part. There is no other stochastic part. I think Yizao meant that.
> 
> Sylvain
> 

Thanks. I consider the leaves to be the ends of random simulations. 
That's why I did not understand.

Rémi