Classic Nintendo games are (computationally) hard
From MaRDI portal
Publication:2347007
DOI10.1016/j.tcs.2015.02.037zbMath1327.68113MaRDI QIDQ2347007
Erik D. Demaine, Alan Guo, Greg Aloupis, Giovanni Viglietta
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, Push-Pull Block Puzzles are Hard, On a generalization of ``eight blocks to madness puzzle, Inventory control under speculation: Myopic heuristics and exact procedures, Mario Kart Is Hard
Cites Work