| Summary: | 碩士 === 東海大學 === 資訊工程學系 === 105 === Nonogram is a typical two-dimensional logical puzzle game of which the player paints each pixel by considering the constraints on the row and column intersecting on that pixel. Solving Nonogram puzzle efficiently has been considered challenging. The recently proposed approaches can efficiently solve many puzzles via the logical deduction based on 2-SAT formulas. In this paper, we first propose a simplified form of the recurrence function in the previous Nonogram algorithm. Our work simplifies the recurrence function from 7 formulas down to 3 formulas. Additionally, we aggregate a group of pixels with known logical relations, called converse and inverse, to significantly reduce the search tree space of the proposed Nonogram backtracking algorithm.
|
|---|
