| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419050 | Discrete Applied Mathematics | 2014 | 13 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Daniel Berend, Dolev Pomeranz, Ronen Rabani, Ben Raziel,