Originally Posted by Dieter
Needle in a haystack, computing times:
When I fix a0,...e0,a1,...,e1,a2,...,e2, the code is able to make an exhaustive search of a3,...,e10. Usually it finds 40000...50000 valid games, needing 7 hours (one thread). The time is needed for checking the 11! permutations of the games.
One of these a0,...e0,a1,...,e1,a2,...,e2combinations, chosen at random, yielded three games with 55 automorphisms. Pure luck!
I have tested some of the permutations with pencil and paper, and they were correct. So I hope that the code works correctly.
