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., Viglietta, Giovanni, Williams, Aaron
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: 2016
Online Access:http://hdl.handle.net/1721.1/103079
https://orcid.org/0000-0003-3803-5703

Internet

http://hdl.handle.net/1721.1/103079
https://orcid.org/0000-0003-3803-5703

Similar Items