# Nonogram Maker (Picross from a Picture) > Nonograms from a drawing or an image, checked for one solution and fixed with givens. Turn a pixel drawing, a built-in picture or a PNG image into a printable nonogram (picross, griddler) with row and column clues. A line solver checks that the puzzle can be solved without guessing; if not, it adds as few given cells as it can until it can. Answer key included. Part of usefulweb.site (https://usefulweb.site/). Part of [Printshop](https://printshop.usefulweb.site/) (ownerApp: printshop). Results are deterministic calculations from the inputs and the listed assumptions; the API returns exactly what the web page shows. ## Use it - Human interface: https://printshopnonogram.usefulweb.site/ (interactive tool at https://printshopnonogram.usefulweb.site/tool) - JSON API: POST https://printshopnonogram.usefulweb.site/api/v1/calculate with a JSON object of inputs (schema: https://printshopnonogram.usefulweb.site/api/v1/tool) - OpenAPI: https://printshopnonogram.usefulweb.site/openapi.json - MCP (Streamable HTTP): https://printshopnonogram.usefulweb.site/mcp - tool `printshop_nonogram` ## Inputs - source (select): Picture from - picture (select): Built-in picture - grid (textarea): Drawing (# = filled, . = empty) - One line per row, up to 50 × 50. - image (file): PNG image - cols (integer): Columns (image) - rows (integer): Rows (image) - threshold (integer): Darkness threshold (image, 0–255) - Cells darker than this are filled. - invert (boolean): Invert (light cells filled) - fix (boolean): Add givens until it solves line by line - seed (text): Seed - The same seed and settings always give the same puzzles. Change it for new ones. - title (text): Title on the page (optional) - answers (boolean): Answer-key pages - header (boolean): Name and date line - paper (select): Paper size - orientation (select): Orientation ## Method - Clues are the lengths of the runs of filled cells in each row and column. Images are reduced to the chosen grid by averaging the Rec. 709 luminance of each cell (transparent parts count as white) and comparing with the threshold. - Line solver: for one row or column, a dynamic programme over (cell, block) from both ends marks every cell that is filled in all placements of the blocks consistent with the known cells, or empty in all of them. Rows and columns are repeated until nothing changes. If that solves the grid, the solution is unique. - Fix: while cells stay undecided, the undecided cell that settles the most other cells when revealed is printed as a given (filled square or a cross) and the line solver runs again. ## Limits - Photos rarely make good nonograms; simple shapes with clear outlines work best. Without givens, a puzzle that is not line-solvable may have several solutions.