Le jeudi 22 février 2007 14:11, Matt Gokey a écrit : > The only thing that matters is the graph topology. A corollary is that > on any board that is completely balanced at the beginning with identical > number of neighbors for all nodes, any 1st play is equivalent and > therefore optimal.
Yes. But the round board at http://www.youdzone.com/go.html is not isotropic, it is a cylinder. You can build it with a square garden wire netting cut at 45°, and add one wire on each border to have 4 neighbors everywhere. If you start from any point and go "straight" you end on a border. If you start from a border and go straight you stay on the border. Alain _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
