Nonograms: Combinatorial questions and algorithms

Daniel Berend; Dolev Pomeranz; Ronen Rabani; Ben Raziel

doi:10.1016/j.dam.2014.01.004

Nonograms: Combinatorial questions and algorithms

Daniel Berend, Dolev Pomeranz, Ronen Rabani, Ben Raziel

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

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.

Original language	English
Pages (from-to)	30-42
Number of pages	13
Journal	Discrete Applied Mathematics
Volume	169
DOIs	https://doi.org/10.1016/j.dam.2014.01.004
State	Published - 31 May 2014

Keywords

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

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2014.01.004

Cite this

@article{2758b01d348140daaa42cd969a9caa64,

title = "Nonograms: Combinatorial questions and algorithms",

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 = "Logic puzzles, Nonogram, Number of solutions, Paint-by-numbers, Solver",

author = "Daniel Berend and Dolev Pomeranz and Ronen Rabani and Ben Raziel",

year = "2014",

month = may,

day = "31",

doi = "10.1016/j.dam.2014.01.004",

language = "English",

volume = "169",

pages = "30--42",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Nonograms

T2 - Combinatorial questions and algorithms

AU - Berend, Daniel

AU - Pomeranz, Dolev

AU - Rabani, Ronen

AU - Raziel, Ben

PY - 2014/5/31

Y1 - 2014/5/31

N2 - 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.

AB - 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.

KW - Logic puzzles

KW - Nonogram

KW - Number of solutions

KW - Paint-by-numbers

KW - Solver

UR - http://www.scopus.com/inward/record.url?scp=84895921401&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2014.01.004

DO - 10.1016/j.dam.2014.01.004

M3 - Article

AN - SCOPUS:84895921401

SN - 0166-218X

VL - 169

SP - 30

EP - 42

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Nonograms: Combinatorial questions and algorithms

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this