# Is there a algorithm to decide that the nonogram puzzle is unique

A good nonogram puzzle have unique solution. However, some nonogram is not. For example

      211
1311231
1
3
2 1
1 1
1 2
3
1


Have at least two solutions

      211
1311231
1 *------
3 --***--
2 1 -**--*-
1 1 -*---*-
1 2 -*--**-
3 --***--
1 ------*

211
1311231
1 *------
3 -***---
2 1 -**-*--
1 1 -*---*-
1 2 --*-**-
3 ---***-
1 ------*


Is there algorithm to decide that the puzzle have unique solution that is more efficien than trying to solve nonogram? Give me the proof/algorithm

• You want an algorithm that you can do with pen and paper or with a computer? – Dr Xorile Jan 9 '16 at 14:25
• The former is better. However, computer algorithm is allowed unless it is just a bruteforce. – Akangka Jan 9 '16 at 14:31
• With dynamic programming you could presumably spit out all the solutions pretty quickly. But you don't want that? – Dr Xorile Jan 9 '16 at 15:24
• @DrXorile I think the OP is looking for algorithms or formulae that don't actually solve it. Just like for example this formula for checking for solvability of slide puzzles – Ivo Beckers Jan 9 '16 at 16:31
• Probably not, since determining whether a Nonogram has a solution is NP complete, as is determining whether a Nonogram had an additional solution given a puzzle and a solution (see here, page 29). – Mike Earnest Jan 10 '16 at 20:17