CAJ | 학술논문

蜂巢数独是类似蜂巢难度又高的变形数独，它有着重要的研究意义。由蜂巢数独谜题提出与之等价的线性规划方程组；从方程组出发推导出求解数独算法的性质，如候选数删除性质、矛盾性质、唯一确定性质、枚举不变性质；基于以上性质，提出用区域序列枚举方法求解蜂巢数独。结合实例计算，提出的算法对中度难度级别的蜂巢数独是有效的。
봉소수독시유사봉소난도우고적변형수독，타유착중요적연구의의。유봉소수독미제제출여지등개적선성규화방정조；종방정조출발추도출구해수독산법적성질，여후선수산제성질、모순성질、유일학정성질、매거불변성질；기우이상성질，제출용구역서렬매거방법구해봉소수독。결합실례계산，제출적산법대중도난도급별적봉소수독시유효적。
Honeycomb sudoku is a kind of deformation of sudoku which is similar to the honeycomb and difficult to solve. Section 1 of the full paper presents the linear programming equation set equivalent with the honeycomb sudoku puzzle. Section 2, the properties of the solution algorithm of honeycomb sudoku are derived from the equation set, such as the property of removing the candidate numbers, the contradictoriness, the unique certainty and the invariance of enumera-tion. Section 3 solves the honeycomb sudoku with a regional sequence enumeration method, and the difference of solving algorithm between the honeycomb sudoku and standard sudoku is compared. The proposed algorithm is proved effective for the honeycomb sudoku of medium level by examples.