Thread: September 2020
View Single Post
Old 2020-09-07, 13:19   #20
SmartMersenne
 
Sep 2017

11001002 Posts
Default

Quote:
Originally Posted by Dieter View Post
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,...,e2-combinations, 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.
This is not pure luck. After some point it is a skill, and you have proven yourself to have that problem-solving skill.
SmartMersenne is offline   Reply With Quote