- Code: Select all
./pg --pattern --verbose --scanfor ......3....9.....5.4.2...6.8...9.7...1.3.4.2...4.5...6.8...1.7.5.....9....2...... < symmetrical_grids > seed
where
- pg is the gridchecker compiled with patterns game extensions (skfr, etc). For windows it could be gridchecker.exe.
- --scanfor xxx gives the pattern (number positions define the pattern, they could be all ones)
- symmetrical_grids is this file (only leftmost 81 characters of the line matter)Hidden Text: Show
- file output is
- Code: Select all
......1....1.....2.2.3...4.5...1.6...7.8.9.2...4.6...9.8...2.7.1.....5....3......
- terminal log is
- Code: Select all
Symmetry Level 2
...................................
Total time 349.116 seconds.
Looking at the loops, the pattern automorphisms matter and grid automorphisms don't. I.e. for this particular pattern the number of checks is halved due to the pattern, and similar timings are expected for any other solution grid for this pattern.
My choice to check against these special solution grids is arbirtary and is inspired by a finding that once Mike played a 10.3/10.3/5.4 puzzle having MC solution.

