On the Difficulty of Nonograms

Batenburg, Kees Joost; Kosters, Walter A.

doi:10.3233/icg-2012-35402

Cited by 5 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An example of a Nonogram and its solution is shown in Figure 5. Batenburg and Kosters (2012) have given a formal definition of Nonograms and provided an algorithm for solving many Nonograms in polynomial time. In Nagao et al (1996) it is proven that the Another Solution Problem for Nonograms is NP-complete, and more in particular that the question whether a given puzzle has a solution is NP-complete.…”

Section: Nonogrammentioning

confidence: 99%

“…The corresponding decision problem NONOGRAM asks if a given Nonogram can be solved. For more information on Nonograms, the reader is referred to Batenburg and Kosters (2012) and the references therein.…”

Section: Definitionmentioning

confidence: 99%

“…Given the values for the cells corresponding to the edges, the gadgets are within the so-called "simple" Nonogram class, and can be easily solved. For a definition and solving algorithm of the "simple" nonograms, the reader is referred to Batenburg and Kosters (2012). In any case, the solutions can be easily verified.…”

Section: Np-completenessmentioning

confidence: 99%

See 2 more Smart Citations

Acyclic Constraint Logic and Games

Hoogeboom¹,

Kosters²,

Rijn³

et al. 2014

ICG

Self Cite

View full text Add to dashboard Cite

Non-deterministic Constraint Logic is a family of graph games introduced by Demaine and Hearn that facilitates the construction of complexity proofs. It is convenient for the analysis of games, providing a uniform view. We focus on the acyclic version, apply this to Klondike, Mahjong Solitaire and Nonogram (that requires planarity), and discuss the more complicated game of Dou Shou Qi. While for the first three games we reobtain known characterizations in a simple and uniform manner, the result for Dou Shou Qi is new.

show abstract

Section: Nonogrammentioning

confidence: 99%

Section: Definitionmentioning

confidence: 99%