You do not have permission to edit this page, for the following reasons:

This IP address has been blocked from editing Wikipedia.
This does not affect your ability to read Wikipedia pages.
Most people who see this message have done nothing wrong. Some kinds of blocks restrict editing from specific service providers or telecom companies in response to recent abuse or vandalism, and can sometimes affect other users who are unrelated to that abuse. Review the information below for assistance if you do not believe that you have done anything wrong.

The IP address or range 54.90.0.0/16 has been blocked (disabled) by ‪Blablubbs‬ for the following reason(s):

The IP address that you are currently using has been blocked because it is believed to be a web host provider or colocation provider. To prevent abuse, web hosts and colocation providers may be blocked from editing Wikipedia.
You will not be able to edit Wikipedia using a web host or colocation provider because it hides your IP address, much like a proxy or VPN.
We recommend that you attempt to use another connection to edit. For example, if you use a proxy or VPN to connect to the internet, turn it off when editing Wikipedia. If you edit using a mobile connection, try using a Wi-Fi connection, and vice versa. If you are using a corporate internet connection, switch to a different Wi-Fi network. If you have a Wikipedia account, please log in.
If you do not have any other way to edit Wikipedia, you will need to request an IP block exemption.

How to appeal if you are confident that your connection does not use a colocation provider's IP address:
If you are confident that you are not using a web host, you may appeal this block by adding the following text on your talk page: ((unblock|reason=Caught by a colocation web host block but this host or IP is not a web host. My IP address is _______. Place any further information here. ~~~~)). You must fill in the blank with your IP address for this block to be investigated. Your IP address can be determined here. Alternatively, if you wish to keep your IP address private you can use the unblock ticket request system. There are several reasons you might be editing using the IP address of a web host or colocation provider (such as if you are using VPN software or a business network); please use this method of appeal only if you think your IP address is in fact not a web host or colocation provider.

Administrators: The IP block exemption user right should only be applied to allow users to edit using web host in exceptional circumstances, and requests should usually be directed to the functionaries team via email. If you intend to give the IPBE user right, a CheckUser needs to take a look at the account. This can be requested most easily at SPI Quick Checkuser Requests. Unblocking an IP or IP range with this template is highly discouraged without at least contacting the blocking administrator.

This block will expire on 10:02, 6 April 2025.

Even when blocked, you will usually still be able to edit your user talk page, as well as email administrators and other editors.

For information on how to proceed, please read the FAQ for blocked users and the guideline on block appeals. The guide to appealing blocks may also be helpful.

Other useful links: Blocking policy · Help:I have been blocked
Your IP address is in a range that has been blocked on all Wikimedia Foundation wikis. The block was made by ‪Jon Kolbert‬. The reason given is Open proxy/Webhost: See the help page if you are affected .
- Start of block: 05:40, 21 February 2024
- Expiry of block: 05:40, 21 February 2029
Your current IP address is 54.90.72.216. The blocked range is 54.90.0.0/16. Please include all above details in any queries you make. If you believe you were blocked by mistake, you can find additional information and instructions in the No open proxies global policy. Otherwise, to discuss the block please post a request for review on Meta-Wiki. You could also send an email to the stewards VRT queue at stewards@wikimedia.org including all above details.

You can view and copy the source of this page:

((Short description|Logic puzzle forming a picture in a grid))
((about|the puzzle|the star polygon|Nonagram|the calculating device|Nomogram))

[[File:Nonogram wiki.svg|thumb|A completed nonogram of the letter "W" from the Wikipedia logo]] 
'''Nonograms''', also known as '''Hanjie''', '''Paint by Numbers''', '''Picross''', '''Griddlers''', and '''Pic-a-Pix''' are picture [[logic puzzles]] in which cells in a grid must be colored or left blank according to numbers at the edges of the grid to reveal a hidden picture. In this puzzle, the numbers are a form of [[discrete tomography]] that measures how many unbroken lines of filled-in squares there are in any given row or column. For example, a clue of "4 8 3" would mean there are sets of four, eight, and three filled squares, in that order, with at least one blank square between successive sets. 

These puzzles are often black and white—describing a [[binary image]]—but they can also be colored. If colored, the number clues are also colored to indicate the color of the squares. Two differently colored numbers may or may not have a space in between them. For example, a black four followed by a red two could mean four black boxes, some empty spaces, and two red boxes, or it could simply mean four black boxes followed immediately by two red ones. Nonograms have no theoretical limits on size, and are not restricted to square layouts.

Nonograms were named after Non Ishida, one of the two inventors of the puzzle.

==Names==
Nonograms are also known by many other names, including Hanjie puzzle, Paint by Numbers,<ref name=":1" /> Crosspix,<ref name=":1" /> Griddlers,<ref name=":1" /> Pic-a-Pix,<ref name=":1" /> Picross,<ref name=":1" /> Picma, PrismaPixels, Pixel Puzzles, Crucipixel, Edel, FigurePic, Hanjie, HeroGlyphix, Illust-Logic, Japanese Crosswords, Japanese Puzzles,<ref name=":0" /> Kare Karala!, Logic Art, Logic Square, Logicolor, Logik-Puzzles, Logimage, Oekaki Logic,<ref name=":1" /> Paint Logic, Picture Logic, Tsunamii, Paint by Sudoku, Picture-forming logic puzzles,<ref name=":0" /> and Binary Coloring Books.

==History==
In 1987, Non Ishida, a Japanese graphics editor, won a competition in Tokyo by designing grid pictures using skyscraper lights that were turned on or off. This led her to the idea of a puzzle based around filling in certain squares in a grid. Coincidentally, a professional Japanese puzzler named Tetsuya Nishio invented the same puzzles independently, and published them in another magazine. At this time, nonograms were also called picture-forming logic puzzles.<ref name=":0">((Cite book |last1=Salcedo-Sanz |first1=Sancho |last2=Ortiz-Garcia |first2=Emilio G. |last3=Perez-Bellido |first3=Angel M. |last4=Portilla-Figueras |first4=Antonio |last5=Yao |first5=Xin |chapter=Solving Japanese Puzzles with Heuristics |date=April 2007 |title=2007 IEEE Symposium on Computational Intelligence and Games |chapter-url=https://ieeexplore.ieee.org/document/4219047 |publisher=[[IEEE]] |pages=224–231 |doi=10.1109/CIG.2007.368102 |isbn=978-1-4244-0709-5|s2cid=13970109 ))</ref><ref name=":1">((Cite web |last=Dalgety |first=James |title=Origins of Cross Reference Grid & Picture Grid Puzzles |url=http://puzzlemuseum.com/griddler/gridhist.htm |access-date=2018-01-08 |website=Puzzle Museum))</ref>

===Print publishing===
In 1988, Non Ishida published three picture grid puzzles in Japan under the name of "Window Art Puzzles". In 1990, James Dalgety in the UK invented the name Nonograms after Non Ishida,((Cn|date=December 2023)) and ''[[The Sunday Telegraph]]'' started publishing them on a weekly basis.<ref name=":1" /> By 1993, the first book of nonograms was published by Non Ishida in Japan. The ''Sunday Telegraph'' published a dedicated puzzle book titled the "Book of Nonograms". Nonograms were also published in Sweden, the United States (originally by [[Games (magazine)|''Games'' magazine]]<ref>((Cite book| url=https://books.google.com/books?id=K98BAAAACAAJ | title=Games Magazine Presents Paint by Numbers | publisher=[[Random House]] | year=1994 | isbn=0-8129-2384-7))</ref>), South Africa and other countries. The ''Sunday Telegraph'' ran a competition in 1998 to choose a new name for their puzzles. Griddlers was the winning name that readers chose. 1993, Ishida published the "Book of Nonograms".<ref name=":0" />

===Electronic puzzles===
Paint by numbers puzzles were implemented by 1995 on hand held electronic toys such as Game Boy and on other plastic puzzle toys. [[Nintendo]] picked up on this puzzle [[fad]] and released two "Picross" (picture crossword) titles for the [[Game Boy]] and nine for the [[Super Nintendo Entertainment System|Super Famicom]] (eight of which were released in two-month intervals for the Nintendo Power Super Famicom Cartridge Writer as the ''NP'' series) in Japan. Only one of these, ''[[Mario's Picross]]'' for the Game Boy, was released outside Japan. Since then, one of the most prolific Picross game developers has been [[Jupiter Corporation]], who released ''[[Picross DS]]'' on the Nintendo DS in 2007, 8 titles in the ''[[Picross e]]'' series for the Nintendo 3DS eShop (along with 5 character-specific titles, including ones featuring [[Pokémon]], [[The Legend of Zelda|Zelda]] and [[Sanrio]] characters), and 9 titles in the ''[[Picross S]]'' series for the Nintendo Switch (along with two character-specific ones featuring [[Kemono Friends]] and [[Overlord (anime)|Overlord]] respectively, and another featuring intellectual properties from [[SEGA]]'s [[Master System]] and [[Sega Genesis|Genesis]]).

Increased popularity in Japan launched new publishers and by now there were several monthly magazines, some of which contained up to 100 puzzles. The Japanese arcade game ''Logic Pro'' was released by Deniam Corp in 1996, with a sequel released the following year. UK games developer Jagex released a nonogram puzzle in 2011 as part of their annual Halloween event for their [[Massively multiplayer online role-playing game|role-playing game]], ''[[Runescape]]''. In 2013, Casual Labs released a mobile version of these puzzles called ''Paint it Back'' with the theme of restoring an art gallery. Released early in 2017, ''Pictopix'' has been presented as a worthy heir to Picross on PC by Rock, Paper, Shotgun.<ref>((cite web|url=https://www.rockpapershotgun.com/2017/01/12/pictopix-review/|title=Wot I Think: Fantastic picross puzzler Pictopix|author=John Walker|work=Rock, Paper, Shotgun|date=12 January 2017 ))</ref> In particular, the game enables players to share their creations.

===Today===
Paint by numbers have been published by Sanoma Uitgevers in the Netherlands, Puzzler Media (formerly British European Associated Publishers) in the UK and Nikui Rosh Puzzles in Israel. Magazines with nonogram puzzles are published in the US, UK, Germany, Netherlands, Italy, Hungary, Finland, the Czech Republic, Slovakia, Russia, Ukraine, and many other countries.

==Example==
{| style="vertical-align:bottom"
|
{| style="border-style:solid; border-width:1px; border-collapse:collapse; empty-cells:show; font-size:95%; line-height:1em; text-align:center;" rules="all"
|+ empty Nonogram
|- style="background:#EFEFEF"
|rowspan="2" colspan="2"|
|style="width:1em"|
|style="width:1em"|
|style="width:1em"|
|style="width:1em"| 2
|style="width:1em"| 2
|style="width:1em"|
|style="width:1em"|
|style="width:1em"|
|- style="background:#EFEFEF"
| 0 || 9 || 9 || 2 || 2 || 4 || 4 || 0
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 0 || || || || || || || ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 4 || || || || || || || ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 6 || || || || || || || ||
|-
|style="background:#EFEFEF"| 2 ||style="background:#EFEFEF"| 2 || || || || || || || ||
|-
|style="background:#EFEFEF"| 2 ||style="background:#EFEFEF"| 2 || || || || || || || ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 6 || || || || || || || ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 4 || || || || || || || ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 2 || || || || || || || ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 2 || || || || || || || ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 2 || || || || || || || ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 0 || || || || || || || ||
|}
|style="width:2em"|
|
{| style="border-style:solid; border-width:1px; border-collapse:collapse; empty-cells:show; font-size:95%; line-height:1em; text-align:center;" rules="all"
|+ solved Nonogram
|- style="background:#EFEFEF"
|rowspan="2" colspan="2"|
|style="width:1em"|
|style="width:1em"|
|style="width:1em"|
|style="width:1em"| 2
|style="width:1em"| 2
|style="width:1em"|
|style="width:1em"|
|style="width:1em"|
|- style="background:#EFEFEF"
| 0 || 9 || 9 || 2 || 2 || 4 || 4 || 0
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 0 || || || || || || || ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 4 || ||style="background:#000000"|  ||style="background:#000000"| ||style="background:#000000"| ||style="background:#000000"| || || ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 6 || ||style="background:#000000"| ||style="background:#000000"| ||style="background:#000000"| ||style="background:#000000"| ||style="background:#000000"| ||style="background:#000000"| ||
|-
|style="background:#EFEFEF"| 2 ||style="background:#EFEFEF"| 2 || ||style="background:#000000"| ||style="background:#000000"| || || ||style="background:#000000"| ||style="background:#000000"| ||
|-
|style="background:#EFEFEF"| 2 ||style="background:#EFEFEF"| 2 || ||style="background:#000000"| ||style="background:#000000"| || || ||style="background:#000000"| ||style="background:#000000"| ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 6 || ||style="background:#000000"| ||style="background:#000000"| ||style="background:#000000"| ||style="background:#000000"| ||style="background:#000000"| ||style="background:#000000"| ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 4 || ||style="background:#000000"| ||style="background:#000000"| ||style="background:#000000"| ||style="background:#000000"| || || ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 2 || ||style="background:#000000"| ||style="background:#000000"| || || || || ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 2 || ||style="background:#000000"| ||style="background:#000000"| || || || || ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 2 || ||style="background:#000000"| ||style="background:#000000"| || || || || ||
|-
|style="background:#EFEFEF"|   ||style="background:#EFEFEF"| 0 || || || || || || || ||
|}
|}

==Solution techniques==
((howto|date=January 2014))((Unreferenced section|date=January 2018))

[[File:Paint by numbers Animation.gif|thumb|Example of a nonogram puzzle being solved using crosses to mark logically-confirmed spaces. Some of the steps of the process are grouped together.]]

To solve a puzzle, one needs to determine which cells will be boxes and which will be empty. Solvers often use a dot or a cross to mark cells they are certain are spaces. Cells that can be determined by logic should be filled. If guessing is used, a single error can spread over the entire field and completely ruin the solution. An error sometimes comes to the surface only after a while, when it is very difficult to correct the puzzle. The hidden picture may help locate and eliminate an error, but otherwise it plays little part in the solving process, as it may mislead.

Many puzzles can be solved by reasoning on a single row or column at a time only, then trying another row or column, and repeating until the puzzle is complete. More difficult puzzles may also require several types of "what if?" reasoning that include more than one row (or column). This works on searching for contradictions, e.g., when a cell cannot be a box because some other cell would produce an error, it must be a space.

===Simple boxes===
At the beginning of the solution, a simple method can be used to determine as many boxes as possible. This method uses conjunctions of possible places for each block of boxes. For example, in a row of ten cells with only one clue of ''8'', the bound block consisting of 8 boxes could spread from
[[File:Paint by numbers - Solving - Example1.png|right]]
* the right border, leaving two spaces to the left;
* the left border, leaving two spaces to the right;
* or somewhere in between.
As a result, the block '''must''' spread through the six centermost cells in the row.

The same applies when there are more clues in the row. For example, in a row of ten cells with clues of ''4'' and ''3'', the bound blocks of boxes could be
[[File:Paint by numbers - Solving - Example2.png|right]]
* crowded to the left, one next to the other, leaving two spaces to the right;
* crowded to the right, one just next to the other, leaving two spaces to the left;
* or somewhere between.
Consequently, the first block of four boxes definitely includes the third and fourth cells, while the second block of three boxes definitely includes the eighth cell. Boxes can therefore be placed in the third, fourth and eighth cells. When determining boxes in this way, boxes can be placed in cells only when the ''same block'' overlaps; in this example, there is overlap in the sixth cell, but it is from different blocks, and so it cannot yet be said whether or not the sixth cell will contain a box.

===Simple spaces===
This method consists of determining spaces by searching for cells that are out of range of any possible blocks of boxes. For example, considering a row of ten cells with boxes in the fourth and ninth cell and with clues of ''3'' and ''1'', the block bound to the clue ''3'' will spread through the fourth cell and clue ''1'' will be at the ninth cell.
[[File:Paint by numbers - Solving - Example3.png|right]]
First, the clue ''1'' is complete and there will be a space at each side of the bound block.

Second, the clue ''3'' can only spread somewhere between the second cell and the sixth cell, because it always has to include the fourth cell; however, this may leave cells that may not be boxes in any case, i.e. the first and the seventh.

Note: In this example all blocks are accounted for; this is not always the case. The player must be careful for there may be clues or blocks that are not bound to each other yet.

===Forcing===
In this method, the significance of the spaces will be shown. A space placed somewhere in the middle of an uncompleted row may force a large block to one side or the other. Also, a gap that is too small for any possible block may be filled with spaces.
[[File:Paint by numbers - Solving - Example4.png|right]]
For example, considering a row of ten cells with spaces in the fifth and seventh cells and with clues of ''3'' and ''2'':
* the clue of ''3'' would be forced to the left, because it could not fit anywhere else.
* the empty gap on the sixth cell is too small to accommodate clues like ''2'' or ''3'' and may be filled with spaces.
* finally, the clue of ''2'' will spread through the ninth cell according to method ''Simple Boxes'' above.

===Glue===
Sometimes, there is a box near the border that is not farther from the border than the length of the first clue. In this case, the first clue will spread through that box and will be forced outward from the border. In the simplest case, whenever a box is present in the first or last cells of a row or column, the first or last clue must be aligned to the edge of that row or column.

[[File:Paint by numbers - Solving - Example5.png|right]]
Considering a row of ten cells with a box in the third cell and with a clue of ''5'', the clue of ''5'' will always span from the third to the fifth cell (but not necessarily to the second or the sixth). It is therefore possible to mark the third, fourth and fifth cell as belonging to the ''5''.

Note: This method may also work in the middle of a row, farther away from the borders.
[[File:Paint by numbers - Solving - Example6.png|right]]
* A space may act as a border, if the first clue is forced to the right of that space.
* The ''first'' clue may also be preceded by some other clues, if all the clues are already bound to the left of the forcing space.

===Joining and splitting===
Boxes closer to each other may be sometimes joined together into one block or split by a space into several blocks. When there are two blocks with an empty cell between, this cell will be:
* A space if joining the two blocks by a box would produce a too large block
* A box if splitting the two blocks by a space would produce a too small block that does not have enough free cells remaining

For example, considering a row of fifteen cells with boxes in the third, fourth, sixth, seventh, eleventh and thirteenth cell and with clues of ''5'', ''2'' and ''2'':
[[File:Paint by numbers - Solving - Example7.png|right]]
* The clue of ''5'' will join the first two blocks by a box into one large block, because a space would produce a block of only 4 boxes that is not enough there.
* The clues of ''2'' will split the last two blocks by a space, because a box would produce a block of 3 continuous boxes, which is not allowed there.
''Note:'' The illustration picture also shows how the clues of ''2'' are further completed. This is, however, not part of the ''Joining and splitting'' technique, but the ''Glue'' technique described above.

===Punctuating===
To solve the puzzle, it is usually also very important to enclose each bound or completed block of boxes immediately by separating spaces as described in ''Simple spaces'' method. Precise punctuating usually leads to more ''Forcing'' and may be vital for finishing the puzzle. ''Note: The examples above did not do that only to remain simple.''

===Mercury===
''Mercury'' is a special case of ''Simple spaces'' technique. Its name comes from the way [[Mercury (element)|mercury]] pulls back from the sides of a container.
[[File:Paint by numbers - Solving - Example8.png|right]]
If there is a box in a row that is in the same distance from the border as the length of the first clue, the first cell will be a space. This is because the first clue would not fit to the left of the box. It will have to spread through that box, leaving the first cell behind. Furthermore, when the box is actually a block of more boxes to the right, there will be more spaces at the beginning of the row, determined by using this method several times.

===Contradictions===
Some more difficult puzzles may also require advanced reasoning. When all simple methods above are exhausted, searching for [[reductio ad absurdum|contradictions]] may help. It is wise to use a pencil (or other color) for that to facilitate corrections. The procedure includes:
# Trying an empty cell to be a box (or then a space).
# Using all available methods to solve as much as possible.
# If an error is found, the tried cell will not be a box for sure. It will be a space (or a box, if space was tried).

[[File:Paint by numbers - Solving - Example9.png]]

In this example a box is tried in the first row, which leads to a space at the beginning of that row. The space then ''forces'' a box in the first column, which ''glues'' to a block of three boxes in the fourth row. However, that is wrong because the third column does not allow any boxes there, which leads to a conclusion that the tried cell must not be a box, so it must be a space.

The problem of this method is that there is no quick way to tell which empty cell to try first. Usually only a few cells lead to any progress, and the other cells lead to dead ends. Most worthy cells to start with may be:
* cells that have many non-empty neighbors;
* cells that are close to the borders or close to the blocks of spaces;
* cells that are within rows that consist of more non-empty cells.

===Mathematical approach===
It is possible to get a start to a puzzle using a mathematical technique to fill in blocks for rows/columns independent of other rows/columns. This is a good "first step" and is a mathematical shortcut to techniques described above. The process is as follows:
[[File:Mathematical approach.png|right]]
# Add the clues together, plus 1 for each "space" in between. For example, if the clue is 6 2 3, this step produces the sum 6 + 1 + 2 + 1 + 3 = 13.
# Subtract this number from the total available in the row (usually the width or height of the puzzle). For example, if the clue in step 1 is in a row 15 cells wide, the difference is 15 - 13 = 2.  Note: If spaces can be used on the left or right (top or bottom) borders, this "shrinks" the available area. If it is known that the rightmost cell is a space, the difference is 14 - 13 = 1.
# Any clues that are greater than the number in step 2 will have some blocks filled in. In the example, this applies to the clues 6 and 3, but not 2.
# For each clue in step 3, subtract the number in step 2 to determine the number of blocks that can be filled in. For example, the 6 clue will have (6 - 2 =) 4 blocks filled in and the 3 clue will have (3 - 2 =) 1. Note: Applying the same procedure to a clue that "failed" step 3 will produce a non-positive number, indicating that no blocks will be filled in for this clue. The clue 2 produces the number (2 - 2 =) 0; if there were a 1 clue, it would produce the number (1 - 2 =) -1.
# To fill in the blocks, assume the blocks are all pushed to one side, count from that side "through" the blocks, and backfill the appropriate number of blocks. This can be done from either direction. For example, the 6 clue can be done either of two ways as follows:
## From the left: Since the 6 is the first number, count 6 blocks from the left edge, ending in the 6th block.  Now "backfill" 4 blocks (the number obtained in step 4), so that cells 3 through 6 are filled.
## From the right: Starting from the right, the clues that are to the right of the 6 clue must be accounted for. Starting from cell 15, count 3 cells for the 3 clue (to cell 13), then a space (12), then the 2 clue (10), then a space (9), then the 6 clue (3). From the 3rd cell, "backfill" 4 blocks, filling cells 3 through 6. The results are the same as doing it from the left in the step above.
# Repeat step 5 for all clues identified in step 3.

In the illustration, row 1 shows the cells that are filled under this procedure, rows 2 and 4 show how the blocks are pushed to one side in step 5, and rows 3 and 5 show the cells backfilled in step 5.

Using this technique for all rows and columns at the start of the puzzle produces a good head start into completing it.  Note: Some rows/columns won't yield any results initially. For example, a row of 20 cells with a clue of 1 4 2 5 will yield 1 + 1 + 4 + 1 + 2 + 1 + 5 = 15. 20 - 15 = 5. None of the clues are greater than 5. Also, this technique can be used on a smaller scale. If there are available spaces in the center or either side, even if certain clues are already discovered, this method can be used with the remaining clues and available spaces.

===Deeper recursion===
Some puzzles may require to go deeper with searching for the contradictions. This is, however, not possible simply by a pen and pencil, because of the many possibilities that must be searched. This method is practical for a computer to use.

===Multiple rows===
In some cases, reasoning over a set of rows may also lead to the next step of the solution even without contradictions and deeper recursion. However, finding such sets is usually as difficult as finding contradictions.

==Nonograms in computing==
Solving nonogram puzzles is an [[NP-complete]] problem.<ref>((Citation|first1=Nobuhisa|last1=Ueda|first2=Tadaaki|last2=Nagao|title=NP-completeness results for NONOGRAM via Parsimonious Reductions|year=1996|place=Technical Report, Department of Computer Science, Tokyo Institute of Technology|volume=TR96-0008|citeseerx = 10.1.1.57.5277))</ref><ref>((citation|title=Playing Games: The complexity of Klondike, Mahjong, Nonograms and Animal Chess|series=master's thesis|publisher=Leiden Institute of Advanced Computer Science, Leiden University|first=Jan N.|last=van Rijn|year=2012|url=http://www.liacs.nl/assets/2012-01JanvanRijn.pdf|access-date=2012-06-29)).</ref><ref>((cite journal |first1=Hendrik Jan|last1=Hoogeboom|first2=Walter|last2=Kosters|first3=Jan N.|last3=van Rijn|first4=Jonathan K.|last4=Vis|title=Acyclic Constraint Logic and Games|year=2014|journal=[[ICGA Journal]]|volume=37|issue=1|pages=3–16|doi=10.3233/ICG-2014-37102|arxiv=1604.05487|s2cid=3120304|access-date=2019-02-24|url=https://content.iospress.com/articles/icga-journal/icg37102))</ref>  This means that there is no [[polynomial time]] [[algorithm]] that solves all nonogram puzzles unless [[P = NP]].

However, certain classes of puzzles, such as those in which each row or column has only one block of cells and all cells are connected, may be solved in polynomial time by transforming the problem into an instance of [[2-satisfiability]].<ref>((citation|first1=Sara|last1=Brunetti|first2=Alain|last2=Daurat|title=An algorithm reconstructing convex lattice sets|journal=Theoretical Computer Science|volume=304|issue=1–3|pages=35–57|year=2003|doi=10.1016/S0304-3975(03)00050-1|s2cid=2803842 |url=https://hal.archives-ouvertes.fr/hal-00023033/file/tomoqconv_els.pdf)); ((citation|first1=Marek|last1=Chrobak|first2=Christoph|last2=Dürr|title=Reconstructing hv-convex polyominoes from orthogonal projections|journal=Information Processing Letters|volume=69|issue=6|year=1999|pages=283–289|doi=10.1016/S0020-0190(99)00025-3|arxiv=cs/9906021|bibcode=1999cs........6021D|s2cid=6799509)); ((citation|first1=Attila|last1=Kuba|first2=Emese|last2=Balogh|title=Reconstruction of convex 2D discrete sets in polynomial time|journal=Theoretical Computer Science|volume=283|issue=1|year=2002|pages=223–242|doi=10.1016/S0304-3975(01)00080-9|doi-access=free)).</ref>

==Software solvers==

An extensive comparison and discussion of nonogram solving algorithms is found at the WebPBN site (Web Paint-By-Number).<ref>((cite web|url=http://webpbn.com/survey/|title=Survey of Paint-by-Number Puzzle Solvers|first = Jan|last = Wolter|date = 25 September 2013))</ref> A Nonogram solver written in [[C++]] and published in the journal ''[[Pattern Recognition (journal)|Pattern Recognition]]'' solves lines in [[quadratic time]] at most.<ref>((cite journal|title=Solving Nonograms by combining relaxations|last1=Batenburg|first1=K.J|last2=Kosters|first2=W.A.|citeseerx = 10.1.1.177.76|doi=10.1016/j.patcog.2008.12.003|year=2009|journal=Pattern Recognition|pages=1672–1683|volume=42|issue=8|bibcode=2009PatRe..42.1672B ))</ref>

==Video game versions==
[[Nintendo]] has published several nonogram video games using the name ((nihongo|"Picross"|ピクロス|Pikurosu)). The [[Nintendo Game Boy]] game ''[[Mario's Picross]]'' was initially released in Japan on March 14, 1995 to decent success. However, the game failed to become a hit in the U.S. market, despite a heavy advertising campaign by Nintendo. The game is of an escalating difficulty, with successive puzzle levels containing larger puzzles. Each puzzle has a limited amount of time to be cleared. Hints (line clears) may be requested at a time penalty, and mistakes made earn time penalties as well (the amount increasing for each mistake). ''Picross 2'' was released later for Game Boy and ''[[Mario's Super Picross]]'' for the Super Famicom, neither of which were translated for the U.S. market (''Mario's Super Picross'' was, however, later released on the [[Wii]] [[Virtual Console]]'s PAL service on September 14, 2007, as part of its [[Fireworks#Japan|Hanabi Festival]], as well as on the Nintendo Switch Online service worldwide on September 23rd, 2020<ref>((cite web|url=https://www.youtube.com/watch?v=OaeBtDePLk0 | title=NES & Super NES - September Game Updates - Nintendo Switch Online | website=[[YouTube]] ))</ref>). Both games introduced ''Wario's Picross'' as well, featuring [[Wario|Mario's nemesis]] in the role. These rounds vary by removing the hint function, and mistakes are not penalized—at the price that mistakes are not even revealed. These rounds can only be cleared when all correct boxes are marked, with no mistakes. The time limit was also removed. Nintendo also released eight ''Picross'' volumes on the Japanese [[Nintendo Power (cartridge)|Nintendo Power]] peripheral in Japan, called ''[[NP Picross]]'', each with a new set of puzzles, including puzzles based around various Nintendo characters, such as [[Mario]], [[The Legend of Zelda]], and [[Pokémon]].

Nintendo has released ''[[Picross DS]]'' for the [[Nintendo DS]] portable system in 2007. It contains several stages of varying difficulty, from 5x5 grids to 25x20 grids. Normal mode tells players if they made an error (with a time penalty) and free mode does not. A hint is available before starting the puzzle in all modes; the game reveals a complete row and column at random. Additional puzzles were available through Nintendo Wi-Fi Connection; some of the original Mario Picross puzzles were available. However, the service was shut down on 20 May 2014. Nintendo made new releases available bi-weekly. ''Picross DS'' was released in [[Europe]] and [[Australia]] on 11 May 2007 and in the [[United States]] on July 30, 2007 and has been received well by critics, including Craig Harris,<ref>((Cite web|url=http://www.ign.com/articles/2007/07/31/picross-ds-review|title=Picross DS Review|last=Harris|first=Craig|date=2007-07-31|website=IGN|language=en-US|access-date=2013-12-18))</ref> Jessica Wadleigh<ref>((Cite news|url=http://www.thunderboltgames.com/review/picross-ds|title=Picross DS|last=Wadleigh|first=Jessica|work=Thunderbolt|access-date=2013-12-18))</ref> and Dave McCarthy <ref>((Cite web|url=http://www.eurogamer.net/articles/picross-ds-review|title=Picross DS|last=McCarthy|first=Dave|date=2007-04-09|website=Eurogamer|language=en-UK|access-date=2013-12-18))</ref> labelling the game "Addictive".<ref>((Harvnb|Harris|2007))</ref><ref>((Harv|McCarthy|2007))</ref> A 3D version of the game, titled ''[[Picross 3D]]'', was also released for the DS in Japan in 2009 and internationally in 2010. A sequel, ''[[Picross 3D: Round 2]]'', was released for the [[Nintendo 3DS]] in 2015.<ref>((cite web|url=http://www.kotaku.co.uk/2015/08/19/picross-3d-finally-getting-sequel|title=Picross 3D Finally Getting a Sequel|author=Jason Schreier|author-link=Jason Schreier|work=Kotaku UK|date=19 August 2015 ))</ref> Another downloadable version of the game was released for Nintendo 3DS's Nintendo eShop, called ''Picross e'', ''Picross e2'', and ''Picross e3'' released in 2013, with ''Picross e4'' released in 2014. Nintendo has also released a [[Pokémon]] spinoff on December 7, 2015 in the form of the [[freemium]] game of ''[[Pokémon Picross]]'' for Nintendo 3DS. ''My Nintendo Picross [[The Legend of Zelda: Twilight Princess]]'' was released for Nintendo 3DS on March 31, 2016, exclusively as a premium reward for [[My Nintendo]].

Other companies have also released nonogram video games, such as Falcross<ref>((cite web|url=http://www.falcross.com/|title=Falcross - Picross puzzles for iPhone and iPad))</ref> on [[iOS]], Across-Stitch by Knitwit Studios on [[Microsoft Windows]] and [[Apple macOS]], and the Color Cross series of games by Little Worlds Studio on the Nintendo DS, [[Microsoft Windows]], and [[iOS]]. In addition, nonogram puzzles have appeared in non-picross puzzle games, such as in [[Deadly Rooms of Death]]'s fifth installment, ''The Second Sky''. In it, nonogram puzzles (again called "Picross" puzzles) representing in-game objects are optional, unlockable puzzles late into the game that can be played in the level "The Central Station", and solving them unlocks bonus levels in the game. In 2018, Konami released a game titled ''Pixel Puzzle Collection'', or ''Picross Puzzle'' (ピクロジパズル), featuring classic Konami characters and sprites.

==Other picture logic puzzles==<!-- This section is linked from [[Other picture logic puzzles]] -->
((More citations needed section|date=January 2018))

'''Pentomino paint-by-numbers''' is a variant in which the twelve [[pentomino]] shapes must be placed in the grid, without touching each other (even diagonally).

'''Triddlers'''<ref>((cite web |url=https://www.griddlers.net/pages/t_rules |title=Triddlers rules and examples |publisher=Griddlers.net |access-date=1 January 2010))</ref> are an offshoot that uses triangle shapes instead of squares.

'''Paint by pairs''' or '''Link-a-Pix''' consists of a grid, with numbers filling some squares; pairs of numbers must be located correctly and connected with a line filling a total of squares equal to that number.  There is only one unique way to link all the squares in a properly-constructed puzzle.  When completed, the squares that have lines are filled; the contrast with the blank squares reveals the picture. (As above, colored versions exist that involving matching numbers of the same color.)

'''Fill-a-Pix''' also uses a grid with numbers within. In this format, each number indicates how many of the squares immediately surrounding it, and itself, will be filled. A square marked "9," for example, will have all eight surrounding squares and itself filled. If it is marked "0" those squares are all blank.

'''Maze-a-Pix''' uses a maze in a standard grid.  When the single correct route from beginning to end is located, each 'square' of the solution is filled in (alternatively, all non-solution squares are filled in) to create the picture.

'''Tile Paint''' is another type of picture logic puzzle by Nikoli. It works like regular nonograms except that it only specifies the ''total'' number of squares in each row or column that will be filled in and irregular sections within the grid have borders around them that indicate that, if one of the squares within it is filled in, all of them must be filled in.

==See also==
* [[Battleship (puzzle)]]

==References==
((Reflist|30em))

[[Category:Nonograms|Nonogram]]
[[Category:Digital geometry]]
[[Category:Logic puzzles]]
[[Category:NP-complete problems]]

Pages transcluded onto the current version of this page (help):

Nonogram (edit)
Template:About (view source) (template editor protected)
Template:Ambox (view source) (template editor protected)
Template:Category handler (view source) (protected)
Template:Citation (view source) (protected)
Template:Citation needed (view source) (protected)
Template:Cite book (view source) (protected)
Template:Cite journal (view source) (protected)
Template:Cite news (view source) (protected)
Template:Cite web (view source) (protected)
Template:Cn (view source) (template editor protected)
Template:Delink (view source) (protected)
Template:Fix (view source) (protected)
Template:Fix/category (view source) (protected)
Template:Harv (view source) (template editor protected)
Template:Harvard citation (view source) (template editor protected)
Template:Harvard citation no brackets (view source) (template editor protected)
Template:Harvnb (view source) (template editor protected)
Template:How-to (view source) (semi-protected)
Template:Howto (view source) (semi-protected)
Template:Main other (view source) (protected)
Template:More citations needed (view source) (template editor protected)
Template:More citations needed section (view source) (template editor protected)
Template:Nihongo (view source) (template editor protected)
Template:Pagetype (view source) (protected)
Template:Reflist (view source) (protected)
Template:Reflist/styles.css (view source) (protected)
Template:SDcat (view source) (protected)
Template:Short description (view source) (protected)
Template:Short description/lowercasecheck (view source) (protected)
Template:Sp (view source) (template editor protected)
Template:Unreferenced (view source) (template editor protected)
Template:Unreferenced section (view source) (template editor protected)
Module:About (view source) (template editor protected)
Module:Arguments (view source) (protected)
Module:Category handler (view source) (protected)
Module:Category handler/blacklist (view source) (protected)
Module:Category handler/config (view source) (protected)
Module:Category handler/data (view source) (protected)
Module:Category handler/shared (view source) (protected)
Module:Check for unknown parameters (view source) (protected)
Module:Citation/CS1 (view source) (protected)
Module:Citation/CS1/COinS (view source) (protected)
Module:Citation/CS1/Configuration (view source) (protected)
Module:Citation/CS1/Date validation (view source) (protected)
Module:Citation/CS1/Identifiers (view source) (protected)
Module:Citation/CS1/Utilities (view source) (protected)
Module:Citation/CS1/Whitelist (view source) (protected)
Module:Citation/CS1/styles.css (view source) (protected)
Module:Delink (view source) (protected)
Module:Disambiguation/templates (view source) (protected)
Module:Exponential search (view source) (template editor protected)
Module:Footnotes (view source) (template editor protected)
Module:Footnotes/anchor id list (view source) (template editor protected)
Module:Footnotes/anchor id list/data (view source) (template editor protected)
Module:Footnotes/whitelist (view source) (template editor protected)
Module:Format link (view source) (template editor protected)
Module:Hatnote (view source) (template editor protected)
Module:Hatnote/styles.css (view source) (template editor protected)
Module:Hatnote list (view source) (template editor protected)
Module:Lang (view source) (template editor protected)
Module:Lang/ISO 639 synonyms (view source) (template editor protected)
Module:Lang/data (view source) (template editor protected)
Module:Language/data/iana languages (view source) (template editor protected)
Module:Language/data/iana regions (view source) (template editor protected)
Module:Language/data/iana scripts (view source) (template editor protected)
Module:Language/data/iana suppressed scripts (view source) (template editor protected)
Module:Language/data/iana variants (view source) (template editor protected)
Module:Message box (view source) (protected)
Module:Message box/ambox.css (view source) (protected)
Module:Message box/configuration (view source) (protected)
Module:Namespace detect/config (view source) (protected)
Module:Namespace detect/data (view source) (protected)
Module:Nihongo (view source) (template editor protected)
Module:Pagetype (view source) (protected)
Module:Pagetype/config (view source) (protected)
Module:Pagetype/disambiguation (view source) (protected)
Module:Pagetype/setindex (view source) (protected)
Module:Pagetype/softredirect (view source) (protected)
Module:SDcat (view source) (protected)
Module:String (view source) (protected)
Module:TableTools (view source) (protected)
Module:Unicode data (view source) (template editor protected)
Module:Unicode data/scripts (view source) (template editor protected)
Module:Unsubst (view source) (protected)
Module:Wikitext Parsing (view source) (protected)
Module:Yesno (view source) (protected)

Return to Nonogram.

Retrieved from "https://en.wikipedia.org/wiki/Nonogram"