| dc.contributor.advisor | Erik Demaine. | en_US |
| dc.contributor.author | Lynch, Jayson (Jayson R.) | en_US |
| dc.contributor.other | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. | en_US |
| dc.date.accessioned | 2016-12-22T15:18:02Z | |
| dc.date.available | 2016-12-22T15:18:02Z | |
| dc.date.copyright | 2015 | en_US |
| dc.date.issued | 2015 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/105999 | |
| dc.description | Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015. | en_US |
| dc.description | This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. | en_US |
| dc.description | Cataloged from student-submitted PDF version of thesis. | en_US |
| dc.description | Includes bibliographical references (pages 49-53). | en_US |
| dc.description.abstract | We classify the computational complexity of two types of motion planning problems represented in games. Portal, a popular video game, is shown to be NP-hard or PSPACE-complete depending on the game mechanics allowed. Push-pull block puzzles are games, similar to Sokoban, which involve moving a 'robot' on a square grid with obstacles and blocks that can be pushed or pulled by the robot into adjacent squares. We prove that push-pull block puzzles in 3D and push-pull block puzzles in 2D with thin walls are NP-hard to solve. We also show certain 3D push-pull block puzzles are PSPACE-complete. This work follows in a long line of algorithms and complexity work on similar problems Wil91, DDO00, Hof00, DHH04, DH01, DO92, DHH02, Cul98, DZ96, Rit10]. The 2D push-pull block puzzle also shows up in a number of video games, thus implying other results, further continuing the work on understanding video games as in Vig12, ADGV14, For10, Cor04. | en_US |
| dc.description.statementofresponsibility | by Jayson Lynch. | en_US |
| dc.format.extent | 53 pages | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Massachusetts Institute of Technology | en_US |
| dc.rights | M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. | en_US |
| dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | en_US |
| dc.subject | Electrical Engineering and Computer Science. | en_US |
| dc.title | On the computational complexity of portal and push-pull block puzzles | en_US |
| dc.type | Thesis | en_US |
| dc.description.degree | M. Eng. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| dc.identifier.oclc | 965798956 | en_US |
