The Computational Complexity of Portal and Other 3D Video Games

@article{Demaine2018TheCC,
  title={The Computational Complexity of Portal and Other 3D Video Games},
  author={Erik D. Demaine and Joshua Lockhart and Jayson Lynch},
  journal={ArXiv},
  year={2018},
  volume={abs/1611.10319}
}
  • Erik D. Demaine, Joshua Lockhart, Jayson Lynch
  • Published 2018
  • Computer Science, Mathematics
  • ArXiv
  • 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… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-8 OF 8 CITATIONS

    The Computational Complexity of Fire Emblem Series and similar Tactical Role-Playing Games

    VIEW 11 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Computational Complexity of Games and Puzzles

    VIEW 1 EXCERPT
    HIGHLY INFLUENCED

    The Computational Complexity of Angry Birds

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    Games, Puzzles and Treewidth

    Trainyard is NP-Hard