Super Mario Bros. Is Harder/Easier than We Thought

Super Mario Bros. Is Harder/Easier than We Thought

Mario is back! In this sequel, we prove that solving a generalized level of Super Mario Bros. is PSPACE-complete, strengthening the previous NP-hardness result (FUN 2014). Both our PSPACE-hardness and the previous NP-hardness use levels of arbitrary dimensions and require either arbitrarily large sc...

Full description

Bibliographic Details
Main Authors: Demaine, Erik D. (Contributor), Viglietta, Giovanni (Author), Williams, Aaron (Author)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: 2016-06-09T14:59:32Z.
Subjects:
Article
Online Access:Get fulltext

Similar Items

Similar Items