m_b_metcalf wrote: How will you ever find a puzzle like this one? And how will you prove it's minimal?
- Code: Select all
001050060600000002040000300030700000006010008000009000500020001070004900008000020 1to9only
The original question was:
A. How to create a sudoku starting from a solution
I answered that.
Now there come up additional demands:
B. How to make difficult puzzles
C. Prove the puzzle is minimal
For B. the answer is simple but time consuming in executing...
It will be the same discussion you already had with
Davy at
http://forum.enjoysudoku.com/generating-sudokus-t38093.html?hilit=generating#p292477where you stated: " You could add a step 6.: if the first step in solving the candidate puzzle involves a single, repeat from 1."
I would suggest step 6: if the generated puzzle does not meet a certain difficulty, repeat from 1.
That is what I do for all of my published puzzles.
For C. This has little value for me. For bits & bytes solvers that may be a huge thing, but I am in for pencil & paper solvers.
Further I like symmetrical puzzle. They are always not minimal I presume.