On 4/7/07, Jacques Basaldúa <[EMAIL PROTECTED]> wrote:
Assuming two simplifying hypotheses: 1. The playouts are uniformly random. 2. Both players have the same number of legal moves (or any unbalanced numbers compensate in the long term).
I did not understand your post either. Is #2 the same as "neither player passes until the end of the game"? Or do you intend to assume that at any given level of the game tree, all nodes have the same number of children? The latter assumption seems to be much stronger than what you intend, since it would imply that p=W exactly. Plus, it is obviously (and dramatically) false under any "normal" go rules where two passes end the game. Weston
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
