This could be extended rather easily to an n-ary tree. With 9x9 a natural choice is 3, but unfortunately 19 is prime.
It's basically a tradeoff between how many adds and how many compares you want to do. I suppose you would do one update for every pick (unless you pick an illegal point and want to remain uniformly random, hehe). So it seems that it would be best to make n as small as possible, at least theoretically... _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
