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.

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players

Author(s)
Bosboom, Jeffrey; Chen, Charlotte; Chung, Lily; Compton, Spencer; Coulombe, Michael; Demaine, Erik D; Demaine, Martin L; Filho, Ivan Tadeu Ferreira Antunes; Hendrickson, Dylan; Hesterberg, Adam; Hsu, Calvin; Hu, William; Korten, Oliver; Luo, Zhezheng; Zhang, Lillian; ... Show more Show less
Thumbnail
DownloadSubmitted version (1.321Mb)
Open Access Policy

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
© 2020 Information Processing Society of Japan. We analyze the computational complexity of several new variants of edge-matching puzzles. First we analyze inequality (instead of equality) constraints between adjacent tiles, proving the problem NP-complete for strict inequalities but polynomial-time solvable for nonstrict inequalities. Second we analyze three types of triangular edge matching, of which one is polynomial-time solvable and the other two are NP-complete; all three are #P-complete. Third we analyze the case where no target shape is specified and we merely want to place the (square) tiles so that edges match exactly; this problem is NP-complete. Fourth we consider four 2-player games based on 1×n edge matching, all four of which are PSPACE-complete. Most of our NP-hardness reductions are parsimonious, newly proving #P and ASP-completeness for, e.g., 1 × n edge matching. Along the way, we prove #P-and ASP-completeness of planar 3-regular directed Hamiltonicity; we provide linear-time algorithms to find antidirected and forbidden-transition Eulerian paths; and we characterize the complexity of new partizan variants of the Geography game on graphs.
Date issued
2020
URI
https://hdl.handle.net/1721.1/143956
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Journal
Journal of Information Processing
Publisher
Information Processing Society of Japan
Citation
Bosboom, Jeffrey, Chen, Charlotte, Chung, Lily, Compton, Spencer, Coulombe, Michael et al. 2020. "Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players." Journal of Information Processing, 28 (0).
Version: Original manuscript

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.