[computer-go] Improvement of UCT search algorithm

[sylvain.gelly at m4x.org]

Le Lundi 09 Octobre 2006 16:35, Don Dailey a écrit :
> On Mon, 2006-10-09 at 10:21 +0200, sylvain.gelly at m4x.org wrote:
> > The solution given by Don (giving more time until the best move and
> > the most
> > sampled are the same) seems quite good. But we didn't try (no time).
> > Don, did this solution give you significant improvements?
>
> I never did a hard core test but I'm quite sure it was a significant
> improvement.   Let me be more specific on what I do:

Thank you Don for the details. I
 have though on a similar method, but I wasn't so motived to do it because I 
though that it would not be significant. But if you think it would be quite 
better, I'll try :-). 
I'll let you know if this is successful.

Sylvain