Daniel Berend
Senior Academic
Nonograms
Combinatorial questions and algorithms
The Nonograms puzzle, also known as Paint by Numbers, is a Japanese logic puzzle. It has been shown that the general problem of solving it is NP-hard. In this paper, we answer several theoretical questions related to the puzzle. In addition, we present a new solver and compare its performance with that of existing solvers.
| Publication language | English |
| Pages | 30-42 |
| Journal | Discrete Applied Mathematics |
| Volume | 169 |
| Publication status | Published - 31.05.2014 |
Keywords
Logic puzzles
Nonogram
Number of solutions
Paint-by-numbers
Solver
ASJC Scopus subject areas
Discrete Mathematics and Combinatorics
Applied Mathematics
