Search

Recommended

 

 

 

 

 

 

Mathematics of Sudoku 

A completed Sudoku grid is a special type of Latin square with the additional property of no repeated values in any partition of the 9×9 block into contiguous 3×3 blocks. The relationship between the two theories is now completely known, after Denis Berthier proved in his recent book, "The Hidden Logic of Sudoku", that a first order formula that does not mention blocks (also called boxes or regions) is valid for Sudoku if and only if it is valid for Latin Squares (this property is trivially true for the axioms and it can be extended to any formula).

The first known calculation of the number of classic 9×9 Sudoku solution grids was posted on the USENET newsgroup rec.puzzles in September 2003[11] and is 6,670,903,752,021,072,936,960 (sequence A107739 in OEIS). This is roughly 1.2×10−6 times the number of 9×9 Latin squares. A detailed calculation of this figure was provided by Bertram Felgenhauer and Frazer Jarvis in 2005.[12] Various other grid sizes have also been enumerated—see the main article for details. The number of essentially different solutions, when symmetries such as rotation, reflection and relabelling are taken into account, was shown by Ed Russell and Frazer Jarvis to be just 5,472,730,538[13] (sequence A109741 in OEIS).