- Code: Select all
..........12.34567.345.6182..1.582.6..86....1.2...7.5...37.5.28.8..6.7..2.7.83615
.------------------.-----------------.-----------------.
| 56789 5679 569 | 1289 1279 129 | 349 349 349 |
| 89 1 2 | 89 3 4 | 5 6 7 |
| 79 3 4 | 5 79 6 | 1 8 2 |
:------------------+-----------------+-----------------:
| 3479 479 1 | 349 5 8 | 2 3479 6 |
| 34579 4579 8 | 6 249 29 | 349 3479 1 |
| 3469 2 69 | 1349 149 7 | 3489 5 349 |
:------------------+-----------------+-----------------:
| 1469 469 3 | 7 149 5 | 49 2 8 |
| 1459 8 59 | 1249 6 129 | 7 349 349 |
| 2 49 7 | 49 8 3 | 6 1 5 |
'------------------'-----------------'-----------------'
.---------.---------.---------.
| 5 7 6 | 8 2 1 | 3 4 9 |
| 8 1 2 | 9 3 4 | 5 6 7 |
| 9 3 4 | 5 7 6 | 1 8 2 |
:---------+---------+---------:
| 7 4 1 | 3 5 8 | 2 9 6 |
| 3 5 8 | 6 9 2 | 4 7 1 |
| 6 2 9 | 1 4 7 | 8 5 3 |
:---------+---------+---------:
| 4 6 3 | 7 1 5 | 9 2 8 |
| 1 8 5 | 2 6 9 | 7 3 4 |
| 2 9 7 | 4 8 3 | 6 1 5 |
'---------'---------'---------'
It's minlex solution
- Code: Select all
123456789456789123798132564231675498584923617679841235367518942815294376942367851
.---------.---------.---------.
| 1 2 3 | 4 5 6 | 7 8 9 |
| 4 5 6 | 7 8 9 | 1 2 3 |
| 7 9 8 | 1 3 2 | 5 6 4 |
:---------+---------+---------:
| 2 3 1 | 6 7 5 | 4 9 8 |
| 5 8 4 | 9 2 3 | 6 1 7 |
| 6 7 9 | 8 4 1 | 2 3 5 |
:---------+---------+---------:
| 3 6 7 | 5 1 8 | 9 4 2 |
| 8 1 5 | 2 9 4 | 3 7 6 |
| 9 4 2 | 3 6 7 | 8 5 1 |
'---------'---------'---------'
It's Minlex place in the ED Catalog took 1 minute & 23 seconds to calculate according to my new Python Script:
http://forum.enjoysudoku.com/dynamic-essentialy-different-grid-search-program-t45995.html
- Code: Select all
Index = 286529978
gang-011 (011.sudz) which has 46788396 entries
Now my question is what does a minlex puzzle look like? I will make an assumption in just putting the clues as far as locations as in the original puzzle. What say thou?
(I will play with it HoDoKu and maybe post more ...)
A try at a minlex puzzle
- Code: Select all
..........56.89123.981.2564..1.754.8..49....7.7...1.3...75.8.42.1..9.3..9.2.67851
.-----------------.----------------.---------------.
| 12347 234 3 | 3467 345 346 | 79 789 9 |
| 47 5 6 | 47 8 9 | 1 2 3 |
| 37 9 8 | 1 3 2 | 5 6 4 |
:-----------------+----------------+---------------:
| 236 236 1 | 236 7 5 | 4 9 8 |
| 23568 2368 4 | 9 23 36 | 26 1 7 |
| 2568 7 59 | 2468 24 1 | 269 3 569 |
:-----------------+----------------+---------------:
| 36 36 7 | 5 13 8 | 69 4 2 |
| 4568 1 5 | 24 9 4 | 3 7 6 |
| 9 34 2 | 34 6 7 | 8 5 1 |
'-----------------'----------------'---------------'
Using HoDoKU I noticed that Setting All Singles solve this, but the solution to the original puzzle had two forcing chains and 3 locked candidates (with the simple way I set-up HoDoKu! Not sure what this says if anything???????
