Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard

Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard

We prove the computational intractability of rotating and placing n square tiles into a 1 × n array such that adjacent tiles are compatible-either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as in jigsaw puzzles. Beyond basic NP-hardness, we prove that it is NP-har...

Full description

Bibliographic Details
Main Authors: Bosboom, Jeffrey William (Author), Demaine, Erik D (Author), Demaine, Martin L (Author), Hesterberg, Adam Classen (Author), Manurangsi, Pasin (Author), Yodpinyanee, Anak (Author)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Department of Materials Science and Engineering (Contributor), Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor)
Format: Article
Language:English
Published: Information Processing Society of Japan (Jōhō Shori Gakkai), 2019-11-12T01:19:08Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items