gizmobench
BrowseDaily

Nonogram Solver

Type the row clues and the column clues, one line each, and press Solve. Ambiguous clues show both pictures; contradictory clues are named before any picture is offered. Grids run to 25 squares a side, squares can be pinned by hand, and everything happens in this tab.

Cluesone line each
Solved60 line solves
10 x 10SolvedUnique
1
2
8
51
62
62
51
8
2
1
2
4
6
8
10
6
1 1
1 1
1 2 1
6

Solved by constraint propagation alone in 60 line solves: every square was forced by the clues, so this is the only grid that fits them.

Grid
x
Status
Solved
Solutions
1
Method
Propagation

Enter one line of clues for each row and each column, using spaces between the numbers in a run and a 0 for a line with no filled squares, then press Solve. Grids run from 1 to 25 squares on a side. The picture is a keyboard: arrow keys move, F pins a square filled, B pins it blank, backspace unpins it, and Enter solves. A square you pin filled shows white and a square you pin blank shows a red tint, and both stay where you put them: that is how you break a tie or enter the squares a book already printed. Clues stay in this browser, and the page’s Start over button forgets them.

Three sets of clues and what comes back

  • Consistent clues10 x 10
    one solution
  • Clues with two answerssame size, two pictures
    two solutions, both shown
  • Contradictory cluesa row longer than the grid
    named as contradictory, no picture
Counted, not guessed. Every row and every column is solved on its own first: for each line the solver works through every arrangement of its clue that fits the squares already decided, and fills in the squares that all of those arrangements agree on. That repeats until nothing changes. Where squares are still undecided it picks one, tries it both ways, and carries on past the first answer to see whether a second exists. That is why the readout can say more than one solution instead of showing a picture and calling it the answer.
Accuracy. Exact constraint solving: a grid it returns satisfies every clue you entered, and it looks for a second solution so it can tell you when the puzzle is ambiguous rather than picking one. Contradictory clues are named instead of half solved. It works in whole squares and whole runs, so there is no rounding to report. Nothing is uploaded: the clues, the propagation and the search all run in this tab, so it works with no connection once the page has loaded. This run took 60 line solves.

Common questions

How do I enter the clues?
Set the width and the height, then put one line of clues in the row box for each row of the grid, top row first, and one line in the column box for each column, left column first. Numbers in a line are separated by spaces or commas, so "3 1 1" and "3,1,1" read the same, and a line with no filled squares at all is written as 0 or left blank. Lines can also be separated by slashes, which is how clues are usually written out in a sentence: "3 / 1 1 / 5" is three rows. The trailing newline a text box leaves at the end is not counted as a line. If the number of lines does not match the number of rows or columns, the page says how many it found and how many the grid needs instead of padding or cutting anything.
What does it mean when a nonogram has more than one solution?
It means the clues do not pin down a single picture: two or more grids satisfy every row clue and every column clue, and nothing in the puzzle chooses between them. A properly set nonogram has exactly one. This solver counts as it searches and stops at the second solution it finds, because the difference that matters is one answer or more than one, not how many more, so the readout says either 1 or more than 1. When it says more than 1, both grids are on screen, the first in the picture and the second underneath it in block characters, and Copy puts both on the clipboard. That usually means a number was missed when the clues were copied in, and it is worth checking them against the source before blaming the puzzle.
Why does it say my clues are contradictory?
Because no grid can satisfy them, and it says which part broke. Three checks run in order. A clue that needs more squares than its line has is named with the room it needs: "6 5" wants twelve squares with the gap between the runs, so it cannot sit in a row ten wide. Then the two totals are compared, since the row clues and the column clues count the same filled squares: if one adds up to 44 and the other to 43, a number is missing, extra or mistyped. Last, the solver itself can run into a line that cannot be filled in any way once the lines crossing it are known, and it names that row or column with its clue. None of the three returns a half solved picture, because a picture that satisfies only some of the clues is not an answer to anything.
How big a grid can it solve, and what happens on a hard one?
From 1 to 25 squares on a side, which covers the puzzles printed in books and magazines. Most of them never need a search at all: the 10 by 10 example the page opens on is settled by propagation alone, and the readout says so under Method. Harder grids branch on an undecided square and try it both ways. That search carries a budget of 60,000 line solves, and when a grid uses it up the answer is unresolved, not impossible: the page shows every square propagation could settle, says how many of them there are, and tells you the limit was on the search rather than on the clues. Pinning one or two squares you are sure of often settles the rest in a second run.
Can I fill in squares I already know?
Yes. Click a square in the grid to pin it filled, click again to pin it blank, and a third click unpins it. From the keyboard, arrow keys move around the grid, F pins a square filled, B pins it blank, backspace unpins it, and Enter solves. A square you pinned filled shows white and one you pinned blank shows a red tint, so your own squares are always distinguishable from the ones the solver worked out. Pinned squares are part of the puzzle from then on: they decide an ambiguous grid, and a square pinned where the clues cannot allow it is reported as a contradiction on that row or column rather than ignored.
Is anything uploaded?
No. The clues, the propagation and the search all happen in this browser tab, and the page makes no request while you work: there is no puzzle library to fetch and no server to send your clues to. Once the page has loaded it keeps working with no connection at all. The clues you type are kept in this browser alone so the page opens where you left it, and the Start over button at the top of the page forgets them. Copy puts the clues, the picture and the status on your clipboard as plain text, with the second solution included when there is one.
Can I solve a nonogram directly from an image or a colored puzzle?
Enter numeric row and column clues for a black-and-white grid, with any known filled or blank squares pinned by hand. There is no image, photo or scanner import and no color-clue input, so the page cannot extract a puzzle from a picture or solve a multicolor nonogram directly. It also has no library or automatic import for a named game's puzzles.
Does the solver explain its algorithm step by step?
The algorithm repeatedly finds all clue arrangements that fit each line and keeps cells shared by every arrangement, then branches on an undecided cell if propagation stops. Method reports whether propagation or search was needed, and line solves counts the work. Those readouts are not a per-deduction tutorial or a sequence of explained moves. The output is a valid picture, a contradiction, multiple answers or an unresolved search within the 60,000-line-solve budget.

Exact constraint solving: a grid it returns satisfies every clue you entered, and it looks for a second solution so it can tell you when the puzzle is ambiguous rather than picking one. Contradictory clues are named instead of half solved.