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

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