Nonograms: Combinatorial questions and algorithms

Daniel Berend, Dolev Pomeranz, Ronen Rabani, Ben Raziel

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


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.

Original languageEnglish
Pages (from-to)30-42
Number of pages13
JournalDiscrete Applied Mathematics
StatePublished - 31 May 2014


  • Logic puzzles
  • Nonogram
  • Number of solutions
  • Paint-by-numbers
  • Solver

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Nonograms: Combinatorial questions and algorithms'. Together they form a unique fingerprint.

Cite this