.png){kind=icon}
返回
Solving Nonograms by combining relaxations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2008.12.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Nonograms, also known as Japanese puzzles, are a specific type of logic drawing puzzles. The challenge is to fill a grid with black and white pixels in such a way that a given description for each row and column, indicating the lengths of consecutive segments of black pixels, is adhered to. Although the Nonograms in puzzle books can usually be solved by hand, the general problem of solving Nomograms is NP-hard. In this paper, we propose a reasoning framework that can be used to determine the value of certain pixels in the puzzle, given a partial filling. Constraints obtained from relaxations of the Nonogram problem are combined into a 2-Satisfiability (2-SAT) problem, which is used to deduce pixel values in the Nonogram solution. By iterating this procedure, starting from an empty grid, it is often possible to solve the puzzle completely. All the computations involved in the solution process can be performed in polynomial time. Our experimental results demonstrate that the approach is capable of solving a variety of Nonograms that cannot be solved by simple logic reasoning within individual rows and columns, without resorting to branching operations. In addition, we present statistical results on the solvability of Nonograms, obtained by applying our method to a large number of Nonograms. (C) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Nonograms
Discrete tomography
Logic reasoning
2-SAT
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
A Tale of Two Port Cities: Ayasuluk (Ephesus) and Balat (Miletus) during the Beyliks Period.png)
Al-Masāq
Al-MasāqIF0
PREAI
分享收藏分享收藏分享收藏Synthesis and mechanical behavior of composite material reinforced with Guadua fiber and with a polyurethane or polyester matrixBioResources
OAAI
BioResourcesIF0
OAAI分享收藏
查看更多内容