Year: 2026
Type: preprint
Abstract: Motivated by worst-case algorithmic time bounds for solving sudoku, we prove that a majority of filled-in $n^2\times n^2$ sudoku grids require all but a logarithmic fraction of cells to be filled by clues. For $9\times 9$ and $16\times 16$ sudoku, we construct grids that require $18$ clues and $80$ clues.
Source: arXiv (Cornell University)
Authors: Eppstein, David, Xinyu, Zhang
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7167714543
Cites:
Cited by:
Related to: