Don Dailey wrote:
I don't quite understand this. If I try move m0, which we will assume is the only winning move, but on the first simulation it turns out to lose, then from what you seem to be saying I would never try it again?
Brian's theorem needs one more hypothesis to be correct: it is necessary to overestimate moves. For instance with W wins out of N, estimate the strength of the move with (W+1)/(N+1). Otherwise, as you suggest, if a winning move is unlucky in the beginning, and another move gets at least a victory, then the unlucky winning move would never be searched again.
Rémi _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
