Polynomial algorithm for solving cross-matching puzzles

DOI10.1007/978-3-030-87897-9_24MaRDI QIDQ2148745zbMATH OpenOpenAlexFDO

Authors Josef Hynek

Publication date 24 June 2022

Full work available at URL https://doi.org/10.1007/978-3-030-87897-9_24

zbMATH Keywords

cross-matching puzzleefficient algorithmtime complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Analysis of algorithms (68W40)

Recommendations

• On the hardness of solving edge matching puzzles as SAT or CSP problems
• Nonograms: combinatorial questions and algorithms
• Puzzles, art, and magic with algorithms
• Counting solutions to CSP using generating polynomials
• It's puzzling

Cited in

(1)

• The Medusa algorithm for polynomial matings

This page was built for publication: Polynomial algorithm for solving cross-matching puzzles

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