On Thu, 2007-01-11 at 17:19 +0100, Sylvain Gelly wrote: > But often it also suddenly pick a really bad move and play it > so the > descrioption above is a little idealized. > > > Did you try picking the move with the highest number of simulations > rather than the higher average? This only modification gave MoGo a > +10% against gnugo in 19x19 (from 40% to 50% with 70k sim/move). And > you can't say that it is a difficult modification to do :).
This is an important improvement and I discovered it myself long ago. Another way is to go into overtime if the best move isn't the most simulated move. It's not clear to me whether you should go to this extra trouble and my current program does the simple thing - exactly as you describe it, just play the most simulated move. I used to extent the thinking time until both the best and most simulated matched - but you have to put some kind of cap on it. I'm really not sure it helps over simply choosing the most simulated move. In problem testing, you will see that when the right move becomes the BEST move, it still takes a few moments before it becomes the most simulated move, but it happens relatively quickly. - Don > Sylvain > _______________________________________________ > computer-go mailing list > [email protected] > http://www.computer-go.org/mailman/listinfo/computer-go/ _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
