MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Author(s)
Bosboom, Jeffrey William; Demaine, Erik D; Demaine, Martin L; Hesterberg, Adam Classen; Manurangsi, Pasin; Yodpinyanee, Anak; ... Show more Show less
Thumbnail
DownloadSubmitted version (328.2Kb)
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
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-hard even to approximately maximize the number of placed tiles (allowing blanks), while satisfying the compatibility constraint between nonblank tiles, within a factor of 0.9999999702 (On the other hand, there is an easy 1/2 -approximation). This is the first (correct) proof of inapproximability for edge-matching and jigsaw puzzles. Along the way, we prove NP-hardness of distinguishing, for a directed graph on n nodes, between having a Hamiltonian path (length n - 1) and having at most 0.999999284(n - 1) edges that form a vertex-disjoint union of paths. We use this gap hardness and gap-preserving reductions to establish similar gap hardness for 1 × n jigsaw and edge-matching puzzles. Keywords: edge-matching puzzles; jigsaw puzzles; computational complexity; hardness of approximation
Date issued
2017-08
URI
https://hdl.handle.net/1721.1/122826
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Department of Materials Science and Engineering; Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Journal
Journal of Information Processing
Publisher
Information Processing Society of Japan (Jōhō Shori Gakkai)
Citation
Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Pasin Manurangsi, Anak Yodpinyanee. "Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard." Journal of Information Processing, 25 (August 2017): 682-694 © 2017 Information Processing Society of Japan
Version: Original manuscript
ISSN
1882-6652

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.