A related question is trying to find the minimum and maximum minimal sudokus. That question is obviously harder than trying to find the minimum and maximum minlex solution grid, as there are a lot more minimal sudokus than solution grids.
My conjectures about that sudokus are the following:
- Code: Select all
Minimum?
+-------+-------+-------+
| . . . | . . . | . . . |
| . . . | . . . | . . 1 |
| . . . | . . 1 | . . 2 |
+-------+-------+-------+
| . . 1 | . . 2 | . . 3 |
| . . 2 | . . . | . 4 . |
| . . 3 | . 4 5 | . . 6 |
+-------+-------+-------+
| . 1 . | . . 3 | . 7 . |
| . 2 5 | . 6 . | . 8 . |
| . 3 6 | 7 . 4 | . 1 9 |
+-------+-------+-------+
- Code: Select all
Maximum?
+-------+-------+-------+
| . . 1 | . . 2 | . . 3 |
| . 4 . | . 5 . | . 6 . |
| 7 . . | 8 . . | 9 . . |
+-------+-------+-------+
| . . 2 | . 6 . | 7 . . |
| . 5 . | 9 . . | . . 1 |
| 8 . . | . . 3 | . 4 . |
+-------+-------+-------+
| . . 6 | 1 . . | . 8 . |
| . 9 . | . . 4 | 2 . . |
| 3 . . | . 7 . | 1 . 5 |
+-------+-------+-------+
Finding the minimum minlex sudoku should be easier than finding the maximum, and the minimality of the minimum is a necessity, not a requirement.
Are there more extremal minlex examples?
Of course that question is very technical, as morphing a sudoku to its minlex form is not trivial. Perhaps sudocue 3 can help. Sudocue 3 can't help, gsf program can (-f%#mc).