The Computational Complexity of Portal and Other 3D Video Games

Abstract

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

16 Figures and Tables

Showing 1-10 of 28 references

Val16] Valve Developer Community. Valve map format. https://developer.valvesoftware.com/ wiki/VMF_documentation

  • 2016

Val13] Valve Developer Community. P2C. https://developer.valvesoftware.com/wiki/P2C

  • 2013

The complexity of the puzzles of Final Fantasy XIII-2

  • Joh12 ] Nathaniel Johnston
  • 2012