Polynomial algorithm for solving cross-matching puzzles

DOI10.1007/978-3-030-87897-9_24zbMATH Open1497.68230OpenAlexW3201838589MaRDI QIDQ2148745FDOQ2148745

Authors: Josef Hynek 

Publication date: 24 June 2022

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

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

zbMATH Keywords

efficient algorithmtime complexitycross-matching puzzle

Mathematics Subject Classification ID

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

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)