Conceptio › Archive › arXiv (All)
arXiv (All) open access

PSPACE-Hard 2D Super Mario Games: Thirteen Doors

MIT Hardness Group et al. · 2024 · arxiv_all
arXiv (All) · Papers · 2024
Open Source ↗Direct PDF ↓
computational-complexity
Conceptio Open Archive

Analyze & explore related research in Conceptio

Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.

[2404.10380] PSPACE-Hard 2D Super Mario Games: Thirteen Doors Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Computer Science > Computational Complexity arXiv:2404.10380 (cs) [Submitted on 16 Apr 2024 ( v1 ), last revised 15 Aug 2026 (this version, v2)] Title: PSPACE-Hard 2D Super Mario Games: Thirteen Doors Authors: MIT Hardness Group , Erik D. Demaine , Lilly Hall , Hayashi Layers , Matias Korman View a PDF of the paper titled PSPACE-Hard 2D Super Mario Games: Thirteen Doors, by MIT Hardness Group and 4 other authors View PDF HTML (experimental) Abstract: We prove PSPACE-hardness for fifteen games in the Super Mario Bros. 2D platforming video game series. Previously, only the original Super Mario Bros. was known to be PSPACE-hard (FUN 2016), though several of the games we study were known to be NP-hard (FUN 2014). Our reductions build door gadgets with open, close, and traverse traversals, in each case using mechanics unique to the game. While some of our door constructions are similar to those from FUN 2016, those for Super Mario Bros. 2, Super Mario Land 2, Super Mario World 2, and the New Super Mario Bros. series are quite different; notably, the Super Mario Bros. 2 door is extremely difficult. Doors remain elusive for just two 2D Mario games (Super Mario Land and Super Mario Run); we prove that these games are at least NP-hard. Subjects: Computational Complexity (cs.CC) Cite as: arXiv:2404.10380 [cs.CC] (or arXiv:2404.10380v2 [cs.CC] for this version) https://doi.org/10.48550/arXiv.2404.10380 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Lilly Hall [ view email ] [v1] Tue, 16 Apr 2024 08:21:30 UTC (3,902 KB) [v2] Sat, 15 Aug 2026 21:56:09 UTC (1,472 KB) Full-text links: Access Paper: View a PDF of the paper titled PSPACE-Hard 2D Super Mario Games: Thirteen Doors, by MIT Hardness Group and 4 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.CC < prev | next > new | recent | 2024-04 Change to browse by: cs References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

Record · ID 612721 · SHA-256 8cf23ef34107afe3
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive