Constructing and Solving Nonograms

Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
Nonograms are logic puzzles in which cells in a grid must be colored or left blank according to numbers at the side and bottom of the grid to reveal a hidden pattern.
[more]
Contributed by: Izidor Hafner (February 2016)
Open content licensed under CC BY-NC-SA
Snapshots
Details
It was shown in [2] that determining whether a nonogram has a solution and finding a solution is NP-complete, which means a difficult programming effort is required to solve either problem.
[1] Wikipedia. "Nonogram." (Jan 21, 2016) en.wikipedia.org/wiki/Nonogram.
[2] J. N. van Rijn, "Playing Games: The Complexity of Klondike, Mahjong, Nonograms and Animal Chess," M. S. thesis, Leiden Institute of Advanced Computer Science, Leiden, Netherlands, 2012. liacs.leidenuniv.nl/assets/2012-01JanvanRijn_2.pdf.
Permanent Citation
"Constructing and Solving Nonograms"
http://demonstrations.wolfram.com/ConstructingAndSolvingNonograms/
Wolfram Demonstrations Project
Published: February 1 2016