基于凸优化模型的Sudoku求解方法及其GUI实现  

Sudoku Solving Method Based on Convex Optimization Model and Implementation of Graphical User Interface

作　　者：胡静[1] 

机构地区：[1]吉首大学商学院,湖南吉首416000

出　　处：《吉首大学学报（自然科学版）》2017年第1期16-18,48,共4页Journal of Jishou University(Natural Sciences Edition)

摘　　要：针对经典的Sudoku问题,提出一种基于凸优化模型求解方法.采用凸优化约束条件描述Sudoku规则,将原始Sudoku问题建模为凸优化问题求解.在满足约束等距性条件时,新算法可以快速准确获得Sudoku结果.利用MATLAB软件设计出求解Sudoku问题的图形用户界面,并通过实例验证了新算法的有效性.model is problem tions are In order to solve the classical Sudoku problem,a novel algorithm based on convex optimization proposed. The rules of Sudoku are described as convex optimization constraints,and the original is modeled as a convex optimization problem. When RIP （Restricted Isometry Property） condi- satisfied, this algorithm can solve the problem efficiently and accurately. Finally, the GUI （Graphical User Interface） is designed to solve Sudoku problem by MATLAB software,and the validity of the proposed method is verified by some examples.

关 键 词：SUDOKU 凸优化 图形用户界面 

分 类 号：O29[理学—应用数学]