Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity

Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity

We show that jigsaw puzzles, edge-matching puzzles, and polyomino packing puzzles are all NP-complete. Furthermore, we show direct equivalences between these three types of puzzles: any puzzle of one type can be converted into an equivalent puzzle of any other type. [PUBLICATION ABSTRACT]

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Graphs and combinatorics 2007-06, Vol.23 (S1), p.195-208
Hauptverfasser: Demaine, Erik D., Demaine, Martin L.
Format: Artikel
Sprache:eng
Schlagworte:
Geometry
Graph theory
Mathematics
Puzzles
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We show that jigsaw puzzles, edge-matching puzzles, and polyomino packing puzzles are all NP-complete. Furthermore, we show direct equivalences between these three types of puzzles: any puzzle of one type can be converted into an equivalent puzzle of any other type. [PUBLICATION ABSTRACT]
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-007-0713-4