Classic Nintendo games are (computationally) hard
From MaRDI portal
Publication:2347007
DOI10.1016/j.tcs.2015.02.037zbMath1327.68113MaRDI QIDQ2347007
Erik D. Demaine, Giovanni Viglietta, Alan Guo, Greg Aloupis
Publication date: 26 May 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.02.037
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Optimizing the Video Game Multi-Jump: Player Strategy, AI, and Level Design, Games, Puzzles and Treewidth, Planar 3-SAT with a clause/variable cycle, Push-Pull Block Puzzles are Hard, On a generalization of ``eight blocks to madness puzzle, Trainyard is NP-hard, Inventory control under speculation: Myopic heuristics and exact procedures, Cooperating in video games? Impossible! Undecidability of team multiplayer games, Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible, Mario Kart Is Hard, Unnamed Item, The complexity of speedrunning video games, Restricted Power - Computational Complexity Results for Strategic Defense Games
Cites Work