Abstract

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:|| <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> 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 l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> norm of x, i.e. min ||x|| <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> s.t. Ax = b, and show numerically that this approach solves representative Sudoku puzzles.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call