> > move = argmax_m number_of_simulations(m) > > > > Olivier, I'm still confused. How should look like the formula for the final > decision? This is very important, becuase if we don't choose a right move to > play, all previous work is useless. > > Basically I would say that you just take the most simulated move. As others said, you can have some improvement by taking into account other elements, but there's little to win and much to loose.
Just the most simulated is secure. Using the upper-confidence-bound, as in the simulation, is really a disaster - you will sometimes pick up a random exploratory move, which is definitely not a good idea :-) Olivier
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
