A Necessary Solution Condition for Sudoku
Combinatorics
2012-10-24 v1 Optimization and Control
Abstract
We develop a new discrete mathematical model which includes the classical Sudoku puzzle, Latin Squares and gerechte designs. This problem is described by integer equations and a special type of inequality constraint. We consider solutions of this generalized problem and derive a necessary condition on these solutions. The results are illustrated with examples.
Cite
@article{arxiv.1210.6343,
title = {A Necessary Solution Condition for Sudoku},
author = {Thomas Fischer},
journal= {arXiv preprint arXiv:1210.6343},
year = {2012}
}
Comments
16 pages, 2 figures