dear Erik, > I was wondering if there is an efficient way to find the number of unique > positions with symmetrical positions excluded.
It's roughly L19/16. That's slightly short, but will be correct in the first 85 or so digits. You just need to correct for the positions with rotational and/or reflective symmetry. Counting those exactly requires a big ugly modification of my program that will take about the same running time, but will just be painful to develop. So I'll pass on that:-) -John _______________________________________________ Computer-go mailing list Computer-go@computer-go.org http://computer-go.org/mailman/listinfo/computer-go
