  We study a system of linear equations associated with Sudoku latin squares.
The coefficient matrix $M$ of the normal system has various symmetries arising
from Sudoku. From this, we find the eigenvalues and eigenvectors of $M$, and
compute a generalized inverse. Then, using linear perturbation methods, we
obtain a fractional completion guarantee for sufficiently large and sparse
rectangular-box Sudoku puzzles.
