Nonogram / Picross Generator
Generate a nonogram picture whose row and column clues have exactly one solution.
What this page makes
Builds a 5×5, 10×10 or 15×15 nonogram from a random picture, prints its run clues, and proves with a line solver that the clues describe exactly that picture.
How to use it
Choose the grid size and difficulty, then press Generate. The numbers above each column and beside each row are the lengths of that line's filled blocks, in order, with at least one empty cell between blocks. Fill the cells that must be filled and mark the rest empty.
Worked example: 10×10, medium difficulty, seed nonogram-demo becomes a clue grid with one proved picture and the filled answer under the board.
What it proves
A binary picture is drawn from the seed, then every row and column run list is computed. The solver enumerates the binary lines matching each clue, propagates forced cells, branches on the row with the fewest candidates, and counts solutions up to two; a picture whose clues allow a second picture is discarded.
What it refuses
A seed whose clues cannot be proved unique inside the node budget and sixty pictures is refused, and the page suggests another seed or size.
Where it runs
The puzzle is generated and solved in this tab: there is no upload, no network request, no stored seed and no model, so nothing you type leaves your device. The same seed and options rebuild the same puzzle exactly.
The rest of the family
The other puzzle generators are listed under Tabletop & Game Tools: killer sudoku, kakuro, KenKen, futoshiki, nonograms, slitherlink, Hashi, word search, crossword, magic squares and buzzword bingo.
Builds a 5×5, 10×10 or 15×15 nonogram from a random picture, prints its run clues, and proves with a line solver that the clues describe exactly that picture.
A binary picture is drawn from the seed, then every row and column run list is computed. The solver enumerates the binary lines matching each clue, propagates forced cells, branches on the row with the fewest candidates, and counts solutions up to two; a picture whose clues allow a second picture is discarded. Every puzzle is generated, solved or checked in this tab: there is no upload, no network request, no stored seed and no model, so nothing you type leaves your device.
Worked example: 10×10, medium difficulty, seed nonogram-demo becomes a clue grid with one proved picture and the filled answer under the board.
Before the puzzle is shown, the same solver is run over it: the answer, the solution count and the node cap are printed under the board, so the proof is checkable rather than promised.
How to use the nonogram / picross generator
Choose the grid size and difficulty, then press Generate. The numbers above each column and beside each row are the lengths of that line's filled blocks, in order, with at least one empty cell between blocks. Fill the cells that must be filled and mark the rest empty.
Every puzzle is generated, solved or checked in this tab: there is no upload, no network request, no stored seed and no model, so nothing you type leaves your device.
- Grid size — one of 5, 10, 15
- Difficulty — one of easy, medium, hard
- Seed (blank draws one) — typed text
What the page proves
Builds a 5×5, 10×10 or 15×15 nonogram from a random picture, prints its run clues, and proves with a line solver that the clues describe exactly that picture.
A binary picture is drawn from the seed, then every row and column run list is computed. The solver enumerates the binary lines matching each clue, propagates forced cells, branches on the row with the fewest candidates, and counts solutions up to two; a picture whose clues allow a second picture is discarded.
- Domain: 5×5, 10×10 and 15×15 binary pictures; density follows the difficulty and the clue lists are printed for every row and column.
- The seed is printed with the puzzle and rebuilds it exactly: the same seed and options always produce the same grid.
- A generation that cannot prove its answer inside the stated node cap is refused with the seed kept, rather than printed with an unchecked answer.
What it refuses, and what it leaves out
A seed whose clues cannot be proved unique inside the node budget and sixty pictures is refused, and the page suggests another seed or size.
- Not the right page for: a coloured nonogram
- Not the right page for: a hand-drawn picture you want to keep exactly
What to Expect
Best for
- a picture puzzle for a printed page
- a quiet logic puzzle
- a smaller grid for a short break
Not ideal for
- a coloured nonogram
- a hand-drawn picture you want to keep exactly
What this tool keeps
- every run clue
- the proved single picture
- the seed that rebuilds it
What may need cleanup
- printing before opening the answer key
- choosing 15×15 only when the page is wide enough
Common errors
- an empty picture is skipped rather than printed as an empty puzzle
- a clue set with two pictures is refused
Example use cases
- a classroom logic exercise
- a printed puzzle book page
- a screen-break puzzle
Sample input
10×10, medium difficulty, seed nonogram-demo
Sample output
a clue grid with one proved picture and the filled answer under the board
Who this is for
- Puzzle players
- Teachers
- Parents
Frequently asked questions
Is my data sent anywhere?
Every puzzle is generated, solved or checked in this tab: there is no upload, no network request, no stored seed and no model, so nothing you type leaves your device.
What can I download or print?
Print shows the puzzle and, if you open it, the answer key. Download writes a plain text file with the seed, the facts the page proved and the answer key; both are produced in this tab and neither is uploaded.
Why does the page print a seed?
So a puzzle can be rebuilt exactly. The same seed and the same options give the same puzzle on any machine, because the only randomness is a hash of the seed. Leave the field blank for a fresh one; the seed that was used is written back into the field.
How do I read the clues?
Each list is read left to right for a row (top to bottom for a column). A 3 2 means a block of three filled cells, at least one empty cell, then a block of two. The printed answer key shows the picture the clues describe.
What does the solver actually prove?
It enumerates every line consistent with each clue and searches for a second complete picture. One solution means no other assignment of filled and empty cells satisfies all the clues; the node count and cap are printed.
Why is a 15×15 hard puzzle sometimes a smaller density?
Lower density makes longer, more ambiguous runs, which is what makes the puzzle harder. The page retries until a unique picture is found; if it cannot, it refuses rather than print an ambiguous grid.
Build custom tools for your store
Join the SDK program to create useful ecommerce utilities for your store.