arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1207.5926cs.AI
收藏

冗余数独规则

Redundant Sudoku Rules

Department of Computer Science KU Leuven(鲁汶大学计算机科学系);Faculty of Information Technology Monash University(莫纳什大学信息技术学院)

Bart Demoen, Maria Garcia de la Banda

摘要:

数独的规则通常使用27个\texttt{all\_different}约束来指定,称为{ \em big} \mrules。利用图形证明和探索性逻辑程序设计,得到了以下主要的新结果:这些大\mrules的六个子集的许多子集是冗余的(即,它们由剩余的21个\mrules所限定),并且6是最大的(即,在保持等效性的同时,不可能去除六个以上的\mrules)。二元不等式约束的相应结果,称为{ \em小} \mrules,是作为一个猜想。

英文摘要:

The rules of Sudoku are often specified using twenty seven \texttt{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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑