Solving nonograms by combining relaxations

DOI10.1016/J.PATCOG.2008.12.003MaRDI QIDQ1023434zbMATH OpenOpenAlexWikidataFDO

Authors K. Joost Batenburg, Walter A. Kosters

Publication date 11 June 2009

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2008.12.003

zbMATH Keywords

discrete tomographynonograms2-SATlogic reasoning

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Nonograms: combinatorial questions and algorithms
• Constructing simple nonograms of varying difficulty
• Solving sudoku: structures and strategies
• Labeling nonograms: boundary labeling for curve arrangements
• A combinatorial problem associated with nonograms

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A combinatorial problem associated with nonograms
• A framework for generating some discrete sets with disjoint components by using uniform distributions
• A unified theory of structural tractability for constraint satisfaction problems
• Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
• Binary vectors partially determined by linear equation systems
• Combinatorial Properties of Matrices of Zeros and Ones
• Discrete tomography. Foundations, algorithms, and applications
• Network flow algorithms for discrete tomography
• Reconstructing convex polyominoes from horizontal and vertical projections
• Reconstruction of convex 2D discrete sets in polynomial time
• Solving nonograms by combining relaxations
• The reconstruction of polyominoes from their orthogonal projections

Cited in

(7)

• Labeling nonograms: boundary labeling for curve arrangements
• Nonograms: combinatorial questions and algorithms
• Constructing simple nonograms of varying difficulty
• Improving the performance of evolutionary algorithms in grid-based puzzles resolution
• Solving nonograms by combining relaxations
• Irregular Learning Cellular Automata for the Resolution of Complex Logic Puzzles
• The asymptotics of useless hint sequences in nonograms

This page was built for publication: Solving nonograms by combining relaxations

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