Classic Nintendo games are (computationally) hard
From MaRDI portal
Publication:2347007
Recommendations
Cites work
Cited in
(23)- 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
- Bust-a-Move/Puzzle Bobble is NP-complete
- The computational complexity of Portal and other 3D video games
- The complexity of speedrunning video games
- Cooperating in video games? Impossible! Undecidability of team multiplayer games
- Restricted Power - Computational Complexity Results for Strategic Defense Games
- Computational complexity of motion planning of a robot through simple gadgets
- Computational complexity of two-dimensional platform games
- Optimizing the video game multi-jump: player strategy, AI, and level design
- Gaming is a hard job, but someone has to do it!
- Games, Puzzles and Treewidth
- Planar 3-SAT with a clause/variable cycle
- Super Mario Bros. is harder/easier than we thought
- Push-pull block puzzles are hard
- Celeste is PSPACE-hard
- The Legend of Zelda: the complexity of mechanics
- Puzzle and dragons is hard
- All paths lead to Rome
- On a generalization of ``eight blocks to madness puzzle
This page was built for publication: Classic Nintendo games are (computationally) hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2347007)