Abstract: 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 enumeration. 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.

Key words: honeycomb sudoku, deformation of sudoku, equation set, regional sequence enumeration method

摘要： 蜂巢数独是类似蜂巢难度又高的变形数独，它有着重要的研究意义。由蜂巢数独谜题提出与之等价的线性规划方程组；从方程组出发推导出求解数独算法的性质，如候选数删除性质、矛盾性质、唯一确定性质、枚举不变性质；基于以上性质，提出用区域序列枚举方法求解蜂巢数独。结合实例计算，提出的算法对中度难度级别的蜂巢数独是有效的。

关键词: 蜂巢数独, 变形数独, 方程组, 区域序列枚举