Nonograms from Invaders

A grid of squares is given. Each square must be filled in gray or left as white. The numbers to the right of the rows or under the columns are the lengths of the runs of gray squares in that row or column. (For example, 1, 2 means there is one gray square followed by two; the number of white squares separating them, before the first one, or after the last two is not given.) The aim is to find all gray squares. Click a square to change its color. You may use yellow to indicate that a square in definitely not gray.
  • Contributed by: Izidor Hafner


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


Determining whether a Nonogram has a solution and finding a solution is NP-complete [2], which means a difficult programming effort to solve either problems.
[1] S. Simpson. "Nonogram Solver." (Dec 20, 2011)
[3] Jan N. van Rijn, Playing Games, Prepend[The complexity of Klondike, Mahjong,, XMLElement[br, {}, {}], Nonograms and Animal Chess], Internal Report 2012–01 June 2012, Universiteit Leiden Opleiding Informatica


    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.