![Page 1: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/1.jpg)
![Page 2: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/2.jpg)
W. H. Freeman1979
![Page 3: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/3.jpg)
A K PetersJuly 2009
translated byRyuhei Uehara
![Page 4: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/4.jpg)
Complexity of Games & Puzzles
0 players(simulation)
1 player(puzzle)
2 players(game)
team,imperfect info
NP
PSPACE EXPTIME
P
Undecidable
NEXPTIMEPSPACE
PSPACE
Rengo Kriegspiel?
bridge?
![Page 5: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/5.jpg)
Constraint Logic[Hearn & Demaine 2009]
PSPACE EXPTIME
P
Undecidable
NEXPTIME
PSPACE
NPPSPACE
0 players(simulation)
1 player(puzzle)
2 players(game)
team,imperfect info
![Page 6: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/6.jpg)
Hamiltonian 𝒔𝒔, 𝒕𝒕 -Path
𝑣𝑣0 𝑣𝑣2 𝑣𝑣4
𝑣𝑣1
𝑣𝑣3
𝑠𝑠
𝑡𝑡𝑣𝑣0 𝑣𝑣2 𝑣𝑣4
𝑣𝑣1
𝑣𝑣3
𝑠𝑠
𝑡𝑡
input goal
![Page 7: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/7.jpg)
100% Speedrun is NP-hard: MarioThe Lost Levels
![Page 8: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/8.jpg)
Speedrun is NP-hard: Zelda
![Page 9: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/9.jpg)
Speedrun is NP-hard: Metroidvania
![Page 10: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/10.jpg)
Speedrun is NP-hard: RPG
![Page 11: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/11.jpg)
Playing is NP-hard: Katamari
![Page 12: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/12.jpg)
Edge-Matching Puzzles[1890s—]
![Page 13: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/13.jpg)
photo by Matěj Baťha
[Christopher Monckton, 2007]US$2,000,000 prize (expired 2010)
![Page 14: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/14.jpg)
NP-hardness of 𝟏𝟏 × 𝒏𝒏 Edge Matching
Reduction from Hamiltonian pathwith specified start 𝑠𝑠 & end vertex 𝑡𝑡
vertextile
edgetile
𝑣𝑣0 𝑣𝑣2 𝑣𝑣4
𝑣𝑣1
𝑣𝑣3
𝑠𝑠
𝑡𝑡
𝑠𝑠
𝑡𝑡
Bosboom, Demaine, Demaine, Hesterberg, Manurangsi, Yodpinyanee 2017
![Page 15: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/15.jpg)
NP-hardness of 𝟏𝟏 × 𝒏𝒏 Edge Matching
or
𝐼𝐼𝑖𝑖 𝑂𝑂𝑖𝑖𝑈𝑈𝑖𝑖
𝑈𝑈𝑖𝑖𝐼𝐼𝑛𝑛𝑈𝑈𝑛𝑛
𝑈𝑈𝑛𝑛
𝑣𝑣𝑖𝑖 𝑡𝑡 = 𝑣𝑣𝑛𝑛𝑠𝑠 = 𝑣𝑣1
𝑣𝑣𝑖𝑖 ,𝑣𝑣𝑗𝑗 𝑣𝑣𝑖𝑖 ,𝑣𝑣𝑗𝑗
𝑂𝑂𝑖𝑖 𝐼𝐼𝑗𝑗𝑂𝑂𝑖𝑖
𝐼𝐼𝑗𝑗
![Page 16: PowerPoint Presentationcourses.csail.mit.edu/6.892/spring19/lectures/C01_images.pdf · 2019-02-06 · NP-hardness of . 𝟏𝟏×𝒏𝒏. Edge Matching. or. 𝐼𝐼. 𝑖𝑖. 𝑂𝑂](https://reader034.vdocuments.us/reader034/viewer/2022050606/5fad5f401e7f51278c29c618/html5/thumbnails/16.jpg)
NP-hardness
vertextile
edgetile
𝑣𝑣0 𝑣𝑣2 𝑣𝑣4
𝑣𝑣1
𝑣𝑣3
𝑠𝑠
𝑡𝑡
𝑠𝑠
𝑡𝑡
Bosboom, Demaine, Demaine, Hesterberg, Manurangsi, Yodpinyanee 2017