Redundant Sudoku Rules
Bart Demoen (Ku Leuven)
Maria Garcia De La Banda (Monash University, Australia)
Abstract
The rules of Sudoku are often specified using twenty seven all different constraints, referred to as the big constraints. Using graphical proofs and exploratory logic programming, the following main and new result is obtained: many subsets of six of these big constraints are redundant (i.e., they are entailed by the remaining twenty one constraints), and six is maximal (i.e., removing more than six constraints is not possible while maintaining equivalence). The corresponding result for binary inequality constraints, referred to as the small constraints, is stated as a conjecture.
Bibtex (Use it for references)
@article{KEYWORD,
journal = {Theory and Practice of Logic Programming},
publisher = {Cambridge University Press},
author = {BART DEMOEN and MARIA {GARCIA DE LA BANDA}},
title = {Redundant Sudoku Rules},
journal = {TPLP},
volume = {14},
number = {3},
year = {2014},
pages = {363-377}
}