By Topic

Linear Systems, Sparse Solutions, and Sudoku

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Babu, P. ; Dept. of Inf. Technol., Uppsala Univ., Uppsala, Sweden ; Pelckmans, K. ; Stoica, Petre ; Jian Li

In this paper, we show that Sudoku puzzles can be formulated and solved as a sparse linear system of equations. We begin by showing that the Sudoku ruleset can be expressed as an underdetermined linear system: Ax = b, where A is of size m times n and n > m. We then prove that the Sudoku solution is the sparsest solution of Ax = b, which can be obtained by lo norm minimization, i.e. min ||x:||0 s.t. Ax = b. Instead of this minimization SB problem, inspired by the sparse representation literature, we solve the much simpler linear programming problem of minimizing the l1 norm of x, i.e. min ||x||1 s.t. Ax = b, and show numerically that this approach solves representative Sudoku puzzles.

Published in:

Signal Processing Letters, IEEE  (Volume:17 ,  Issue: 1 )