摘要
对角线数独是一个变形数独,该文根据对角线数独的求解规则,建立了与对角线数独的解等价的0-1整数线性规划模型。并用专门求解0-1整数线性规划模型的LINGO软件实现求解,最后用中级对角线数独谜题表明该方法的有效性。
Diagonal Sudoku is a variation of the classical Sudoku problem. In this paper, an integer program model based on therules for Diagonal Sudoku is proposed. Moreover, the LINGO model for solving the integer program is given. Lastly, an example isused to demonstrate the effectiveness of the proposed model.
出处
《电脑知识与技术》
2015年第4X期91-93,共3页
Computer Knowledge and Technology
关键词
对角线数独
线性规划
等价性
diagonal sudoku
linear program
equivalent
