Edge-matching problems with rotations

DOI10.1007/978-3-642-22953-4_10MaRDI QIDQ3088275zbMATH OpenOpenAlexWikidataFDO

Authors Martin Ebbesen, Paul Fischer, Carsten Witt

Publication date 19 August 2011

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1703.09421

Mathematics Subject Classification ID

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

Abstract: Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem has gained interest recently with the (now terminated) Eternity~II puzzle, and new complexity results. In this paper we consider a number of settings which differ in size of the puzzles and the manipulations allowed on the pieces. We investigate the effect of allowing rotations of the pieces on the complexity of the problem, an aspect that is only marginally treated so far. We show that some problems have polynomial time algorithms while others are NP-complete. Especially we show that allowing rotations in one-row puzzles makes the problem NP-hard. The proofs of the hardness result uses a large number of colors. This is essential because we also show that this problem (and another related one) is fixed-parameter tractable, where the relevant parameter is the number of colors.

Recommendations

• Approximability of Edge Matching Puzzles
• Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
• On the hardness of solving edge matching puzzles as SAT or CSP problems
• A global approach for solving edge-matching puzzles
• Complexity of tile rotation problems

Cites work

• An Eulerian exposition
• An Eulerian path approach to DNA fragment assembly
• Approximability of Edge Matching Puzzles
• Complexity of tile rotation problems
• scientific article; zbMATH DE number 67483 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
• The complexity of satisfiability problems

Cited in

(6)

• Complexity of tile rotation problems
• Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
• Matchstick puzzles on a grid
• A global approach for solving edge-matching puzzles
• A guide-and-observe hyper-heuristic approach to the Eternity II puzzle
• A guide-and-observe hyper-heuristic approach to the Eternity II puzzle

This page was built for publication: Edge-matching problems with rotations

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