Constructing simple nonograms of varying difficulty

MaRDI QIDQ2915580zbMATHFDO

Authors Sjoerd Henstra, Willem Jan Palenstijn, K. Joost Batenburg, Walter A. Kosters

Publication date 18 September 2012

Published in PU.M.A. Pure Mathematics and Applications (Search for Journal in Brave)

zbMATH Keywords

difficulty measurestructure of nonograms with lowest difficulty

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)

Recommendations

• Nonograms: combinatorial questions and algorithms
• Solving nonograms by combining relaxations
• Labeling nonograms: boundary labeling for curve arrangements
• The asymptotics of useless hint sequences in nonograms
• Shikaku and Ripple Effect are NP-complete

Cited in

(4)

• Nonograms: combinatorial questions and algorithms
• Labeling nonograms: boundary labeling for curve arrangements
• The asymptotics of useless hint sequences in nonograms
• Solving nonograms by combining relaxations

This page was built for publication: Constructing simple nonograms of varying difficulty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915580)