Donate SIGN UP

Compiling Sudoku Puzzles

Avatar Image
SteveD | 16:40 Sun 25th Sep 2016 | Quizzes & Puzzles
1 Answers
I assume that a sudoku puzzle compiler starts with a fully-completed grid. How does he/she then decide which and how many numbers can be removed for the different levels of difficulty while allowing the puzzle to be solvable?
Gravatar

Answers

Only 1 answerrss feed

Best Answer

No best answer has yet been selected by SteveD. Once a best answer has been selected, it will be shown here.

For more on marking an answer as the "Best Answer", please visit our FAQ.
I don't know the answer, but all must be solvable if they start off complete. What I do wonder though is how they determine the degree of difficulty, and how they can be sure that there is a unique solution.. There must be some pattern that they follow, but I have done a couple that had more than one solution. I would be interested to know the answers.

Only 1 answerrss feed

Do you know the answer?

Compiling Sudoku Puzzles

Answer Question >>

Related Questions

Sorry, we can't find any related questions. Try using the search bar at the top of the page to search for some keywords, or choose a topic and submit your own question.