数独问题的求解、评价与生成算法的研究  

Study on Solution,Evaluation and Generation Algorithm of Sudoku Problem

作　　者：王琼[1,2] 邹晟[3] 

机构地区：[1]南京师范大学计算机科学与技术学院,江苏南京210097 [2]江苏省信息安全与保密工程研究中心,江苏南京210097 [3]南京师范大学中北学院,江苏南京210097

出　　处：《南京师范大学学报（工程技术版）》2010年第1期76-79,共4页Journal of Nanjing Normal University(Engineering and Technology Edition)

摘　　要：将数独问题分解为求解初盘、难度评价、生成有解初盘、生成有唯一解初盘等子问题.为求解初盘,提出了基于最小候选数的搜索算法,并基于算法中的判定树,给出了难度指标的计算方法.生成有唯一解初盘的算法分为两步:首先生成有解初盘集合,再利用判定树进行筛选.In the paper, Sudoku problem is divided into solving original layout, calculating difficulty indicator, generating original layout of solvable, generating original layout which has a unique solution. To solve original layout, search algorithm based on the minimum candidate number is proposed. Calculation method of game difficulty is established with decision tree. Generating original layout which bas a unique solution is divided into two steps： first, solvable original layouts are generated, and then, desired layouts are selected by decision tree.

关 键 词：数独 候选数 搜索算法 判定树 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]