> Shouldnt that number at most be 722^#positions? Since adding a black or a > white stone is something fundamentally different?
The upper bound of 361^L(19,19) games is from Theorem 7 on page 31 of http://tromp.github.io/go/gostate.pdf, where you will find a proof. As the paragraph preceding that theorem explains, the difference from your suggestion is due to the average position having only 361/3 empty points available for play. -John _______________________________________________ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go
