Skip to content
Puzzle diagnosis4 min readPublished

Can a Sudoku have multiple solutions? A concrete example

Yes. A Sudoku has multiple solutions when at least two different completed grids satisfy the row, column and box rules while preserving every given. Finding one valid completion proves solvability; it does not prove uniqueness. A uniqueness check must continue looking for a second completion.

The worked example

9 by 9 Sudoku teaching diagramAll 1s and 2s were removed from a completed grid. The 63 remaining givens contain digits 3–9. At r1c1 and r1c2, both 1 and 2 are candidates. Row 1: blank, blank, 3, 4, 5, 6, 7, 8, 9. Row 2: 4, 5, 6, 7, 8, 9, blank, blank, 3. Row 3: 7, 8, 9, blank, blank, 3, 4, 5, 6. Row 4: blank, 3, 4, 5, 6, 7, 8, 9, blank. Row 5: 5, 6, 7, 8, 9, blank, blank, 3, 4. Row 6: 8, 9, blank, blank, 3, 4, 5, 6, 7. Row 7: 3, 4, 5, 6, 7, 8, 9, blank, blank. Row 8: 6, 7, 8, 9, blank, blank, 3, 4, 5. Row 9: 9, blank, blank, 3, 4, 5, 6, 7, 8.c1r1c2r2c3r3c4r4c5r5c6r6c7r7c8r8c9r9
All 1s and 2s were removed from a completed grid. The 63 remaining givens contain digits 3–9. At r1c1 and r1c2, both 1 and 2 are candidates.

Read coordinates from the top left: r = row, c = column. Small digits are candidates. Outlines identify the cells discussed in the caption.

Open this example in the solver
View the exact 81-cell input

Read left to right across each row, then top to bottom. A 0 means a blank.

003456789456789003789003456034567890567890034890034567345678900678900345900345678

Keep every given and change only the blanks

Take the completed grid shown below as completion A. Remove every 1 and every 2 to get the example puzzle. There are nine of each, so 18 cells become blank and 63 givens remain.

Now swap every 1 and 2 throughout completion A: each 1 becomes 2, and each 2 becomes 1. This produces completion B. All digits 3–9 remain untouched, so both completions preserve every given in the puzzle.

9 by 9 Sudoku teaching diagramCompletion A: r1c1 = 1 and r1c2 = 2. All 81 cells obey the standard rules. Row 1: 1, 2, 3, 4, 5, 6, 7, 8, 9. Row 2: 4, 5, 6, 7, 8, 9, 1, 2, 3. Row 3: 7, 8, 9, 1, 2, 3, 4, 5, 6. Row 4: 2, 3, 4, 5, 6, 7, 8, 9, 1. Row 5: 5, 6, 7, 8, 9, 1, 2, 3, 4. Row 6: 8, 9, 1, 2, 3, 4, 5, 6, 7. Row 7: 3, 4, 5, 6, 7, 8, 9, 1, 2. Row 8: 6, 7, 8, 9, 1, 2, 3, 4, 5. Row 9: 9, 1, 2, 3, 4, 5, 6, 7, 8.c1r1c2r2c3r3c4r4c5r5c6r6c7r7c8r8c9r9
Completion A: r1c1 = 1 and r1c2 = 2. All 81 cells obey the standard rules.

Why the second completion is valid

Each row, column and box in completion A contains one 1 and one 2. Swapping their names everywhere still leaves one of each in every unit. None of the other seven digits moves. That proves completion B is a valid completed Sudoku, not just a conflict-free partial board.

The two completions differ at r1c1, so they are distinct. These two witnesses are enough to prove non-uniqueness. We do not need to claim that there are exactly two solutions or count every possible completion.

9 by 9 Sudoku teaching diagramCompletion B: every 1 and 2 is exchanged, including r1c1 = 2 and r1c2 = 1. All 63 givens still match. Row 1: 2, 1, 3, 4, 5, 6, 7, 8, 9. Row 2: 4, 5, 6, 7, 8, 9, 2, 1, 3. Row 3: 7, 8, 9, 2, 1, 3, 4, 5, 6. Row 4: 1, 3, 4, 5, 6, 7, 8, 9, 2. Row 5: 5, 6, 7, 8, 9, 2, 1, 3, 4. Row 6: 8, 9, 2, 1, 3, 4, 5, 6, 7. Row 7: 3, 4, 5, 6, 7, 8, 9, 2, 1. Row 8: 6, 7, 8, 9, 2, 1, 3, 4, 5. Row 9: 9, 2, 1, 3, 4, 5, 6, 7, 8.c1r1c2r2c3r3c4r4c5r5c6r6c7r7c8r8c9r9
Completion B: every 1 and 2 is exchanged, including r1c1 = 2 and r1c2 = 1. All 63 givens still match.

63 clues still do not guarantee uniqueness

This deliberately constructed example has many more givens than a typical newspaper puzzle, yet it is ambiguous. The count tells you how many cells are specified; it does not tell you whether those givens distinguish all valid completions.

Giving the two versions different difficulty labels would not fix the issue. Difficulty is about the work needed to reach a solution under an agreed method. Uniqueness is about how many valid completions exist. Establish uniqueness before attaching a normal puzzle difficulty rating.

What the solver can and cannot conclude

A solver may stop as soon as it finds one completed grid. That is enough for ‘a solution exists’. To report ‘unique’, it must also rule out every alternative. Sudoku Slate’s checker searches until it has either exhausted the possibilities or found a second completion.

When the result is multiple solutions, do not treat the first returned answer as the intended answer. If you copied a puzzle that was meant to be unique, look for omitted givens. If you are designing the puzzle yourself, revise the givens and check uniqueness again.

Adding a given taken from one valid completion eliminates completions that disagree with it, but may leave several others. A fresh uniqueness check is still required. Never infer a unique result just because the extra digit removed the two examples you happened to inspect.

Check your understanding

Would writing r1c1 = 1 eliminate completion B? Would that fact alone prove the revised puzzle is unique?

Show the reasoning

It would eliminate completion B, because B has 2 at r1c1. But ruling out one known alternative is not a proof that no other alternatives exist. The revised puzzle needs its own complete uniqueness check.

About this example

This example was constructed for Sudoku Slate from a completed grid. Many givens are retained to make the specific deduction easy to inspect. Diagnostic examples are deliberately conflicting or ambiguous where stated; these are teaching positions, not difficulty-rated game puzzles.

Rules and terminology

  • Nikoli: Sudoku rules

    The standard row, column and 3 × 3 box rules used in these examples. The board and worked explanation on this page were created separately.