Re: [computer-go] Improvement of UCT search algorithm

2006-10-10 Thread Don Dailey
On Tue, 2006-10-10 at 10:17 +0200, [EMAIL PROTECTED] wrote: > So indeed choosing the move with highest number of simulations seem a > little > better, whereas it is not statistically very significant (I could try > with > more games, but 800 is already quite a lot :-)). Usually, a high scoring m

Re: [computer-go] Improvement of UCT search algorithm

2006-10-10 Thread sylvain . gelly
> > Results: (number of win/number of games with MoGo playing black, then > > with MoGo playing white, then percentage over all the games). > > * Choosing the move with the highest value: 338/425(b),352/425(w) > > (81.2%/850) * Choosing the move with the highest (value-(standard > > deviation)/sqrt

Re: [computer-go] Improvement of UCT search algorithm

2006-10-10 Thread Łukasz Lew
On 10/10/06, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote: Le Lundi 09 Octobre 2006 17:34, Don Dailey a écrit: > I would like to know the results if you do some tests on this. Hello, here are the results comparing the methods of choosing the best move. I have not yet tested the more complicated s

Re: [computer-go] Improvement of UCT search algorithm

2006-10-10 Thread sylvain . gelly
Le Lundi 09 Octobre 2006 17:34, Don Dailey a écrit : > I would like to know the results if you do some tests on this. Hello, here are the results comparing the methods of choosing the best move. I have not yet tested the more complicated solution of giving more time if necessary. The benchmark: