Conclusion-first mathematical guide to Sudoku: how Felgenhauer & Jarvis proved 6,670,903,752,021,072,936,960 total grids, why Gary McGuire's 2012.
How many valid ways can you fill an empty 9×9 Sudoku grid so that every row, column, and 3×3 box contains the digits 1 through 9 without repetition?
Without the 3×3 block constraint, a 9×9 Latin Square has $5,524,751,496,156,892,842,531,225,600$ ($\approx 5.52 \times 10^{27}$) valid arrangements. Adding the nine 3×3 box constraints restricts the possibilities by roughly a factor of one million.
In 2005, Bertram Felgenhauer (Germany) and Frazer Jarvis (UK) combined group-theoretic symmetry reduction with exhaustive backtracking enumeration of the top 3 rows (the 362,880 ways to fill Block 1 multiplied by the 94,810,963,968 valid completions of Blocks 2 and 3, reduced into equivalence classes) to prove that the exact number of valid 9×9 Sudoku solution grids is 6,670,903,752,021,072,936,960 ($\approx 6.67 \times 10^{21}$).
Many of those $6.67 \times 10^{21}$ grids are structurally identical under symmetry transformations: relabeling digits ($9! = 362,880$ permutations), permuting the 3 horizontal bands or 3 vertical stacks ($6 \times 6$), permuting rows/columns within a band/stack ($6^6$), and rotating or reflecting the board. In 2006, Ed Russell and Frazer Jarvis applied Burnside's Lemma across the full Sudoku symmetry group of order $3,359,232 \times 9!$ to prove that there are exactly 5,472,730,538 essentially different Sudoku solution grids.
For decades, one of the most famous open problems in recreational mathematics was the Minimum Sudoku Problem: What is the smallest number of initial clues (givens) that a 9×9 Sudoku puzzle can have while still possessing a unique solution?
While puzzle enthusiasts (notably Gordon Royle's collection of over 49,000 non-isomorphic 17-clue puzzles) found thousands of valid 17-clue Sudokus, nobody knew whether a valid 16-clue Sudoku existed.
In January 2012, mathematician Prof. Gary McGuire, Bastian Tugemann, and Gilles Civario at University College Dublin (UCD) settled the question permanently. Using a high-performance supercomputer cluster running for over 7 million CPU hours, they tested every single one of the 5,472,730,538 essentially different completed Sudoku grids using a specialized hitting-set algorithm. Their result proved that no 16-clue Sudoku with a unique solution exists anywhere in the mathematical universe—the minimum possible number of clues is strictly 17.
The core concept behind McGuire's proof is the Unavoidable Set (known to human solvers as a Deadly Pattern). Suppose rows 1 and 2 of a completed grid contain the cells [1, 2] and [2, 1] in the same two columns within the same 3×3 blocks. Those 4 cells form a reversible $2 \times 2$ cycle: if none of those 4 cells is given as an initial clue, a solver can swap the 1s and 2s in those 4 cells to produce a second valid solution without violating any row, column, or box rule! To guarantee a unique solution, the initial clues must form a "hitting set" that pins at least one cell in every single Unavoidable Set across the 81 cells—and McGuire proved that no set of 16 cells can simultaneously intersect every Unavoidable Set in any valid 9×9 grid.
By the exact same Deadly Pattern logic, if you take a completed 81-cell grid and erase only the 4 cells of a reversible [1, 2] / [2, 1] rectangle—leaving 77 given numbers on the board—those remaining 4 cells still admit 2 valid solutions! Thus, 77 is the maximum number of clues for which a Sudoku can still be ambiguous, whereas any 78 clues on a valid grid are guaranteed to determine a unique solution.
| Mathematical Property | Exact Value / Theorem | Practical Meaning for Players |
|---|---|---|
| Total Valid 9×9 Grids | 6,670,903,752,021,072,936,960 (Felgenhauer & Jarvis, 2005) |
An practically infinite supply of boards—you will never play the same grid twice. |
| Essentially Different Grids | 5,472,730,538 (Russell & Jarvis, 2006) |
Over 5.47 billion distinct structural skeletons even after removing all rotations and digit swaps. |
| Minimum Clues for Unique Solution | 17 Clues (McGuire et al., 2012) |
16 or fewer clues always yield at least 2 solutions; 17 is the absolute mathematical floor. |
| Maximum Non-Unique Clues | 77 Clues (Unpinned 2×2 Deadly Pattern) |
Poorly generated puzzles without uniqueness verification can force 50/50 guessing at the very last 4 cells. |
| Computational Complexity | NP-Complete ($n^2 \times n^2$) (Yato & Seta, Univ. of Tokyo, 2003) |
Solved as an Exact Cover problem via Knuth's Dancing Links (Algorithm X) in <1 millisecond. |
ナンプレ.jp guarantees a unique solution for every puzzle on our site through a proprietary 3-stage generation and verification algorithm. Whether you are playing Today's Daily 7 Courses, Expert, Master, or downloading A4 Printable PDFs, every puzzle passes through the following pipeline: