Redundant Sudoku rules

DOI10.1017/S1471068412000361MaRDI QIDQ5418948zbMATH OpenOpenAlexWikidataFDO

Authors Bart Demoen, Maria Garcia De La Banda

Publication date 30 May 2014

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1207.5926

zbMATH Keywords

inequalitiesmaximal redundancySudoku

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Logic programming (68N17)

Abstract: The rules of Sudoku are often specified using twenty seven exttt{all_different} constraints, referred to as the {em big} mrules. Using graphical proofs and exploratory logic programming, the following main and new result is obtained: many subsets of six of these big mrules are redundant (i.e., they are entailed by the remaining twenty one mrules), and six is maximal (i.e., removing more than six mrules is not possible while maintaining equivalence). The corresponding result for binary inequality constraints, referred to as the {em small} mrules, is stated as a conjecture.

Recommendations

• Solving Sudoku puzzles with rewriting rules
• scientific article; zbMATH DE number 5178940
• Pandiagonal sudokus
• Solving sudoku: structures and strategies
• Sudoku: strategy versus structure

Cites work

• D-FLAT: declarative problem solving using tree decompositions and answer-set programming

Cited in

(3)

• Redundant disequalities in the Latin square problem
• Solving Sudoku puzzles with rewriting rules
• Graphs with coloring redundant edges

This page was built for publication: Redundant Sudoku rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418948)