The computational complexity of portal and other 3D video games
Name
LIPIcs-FUN-2018-19.pdf
Description
Published version
Size
3.25 MB
Format
Adobe PDF
Checksum (MD5)
12e1ab946b8ec319454040055dbb2d10
Author(s)
Demaine, Erik
Lynch, Jayson
Lockhart, Joshua
Date Issued
2018
Citation
Demaine, Erik, Lynch, Jayson and Lockhart, Joshua. 2018. "The computational complexity of portal and other 3D video games."
Version
Final published version
Abstract
© Erik D. Demaine, Joshua Lockhart, and Jayson Lynch; licensed under Creative Commons License CC-BY 9th International Conference on Fun with Algorithms (FUN 2018). We classify the computational complexity of the popular video games Portal and Portal 2. We isolate individual mechanics of the game and prove NP-hardness, PSPACE-completeness, or pseudo-polynomiality depending on the specific game mechanics allowed. One of our proofs generalizes to prove NP-hardness of many other video games such as Half-Life 2, Halo, Doom, Elder Scrolls, Fallout, Grand Theft Auto, Left 4 Dead, Mass Effect, Deus Ex, Metal Gear Solid, and Resident Evil. These results build on the established literature on the complexity of video games [1, 3, 7, 18].
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution 4.0 International license
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.4230/LIPIcs.FUN.2018.19
