Pages that link to "Item:Q2347007"
From MaRDI portal
The following pages link to Classic Nintendo games are (computationally) hard (Q2347007):
Displayed 13 items.
- On a generalization of ``eight blocks to madness'' puzzle (Q906490) (← links)
- Trainyard is NP-hard (Q1623273) (← links)
- Inventory control under speculation: Myopic heuristics and exact procedures (Q1847164) (← links)
- Cooperating in video games? Impossible! Undecidability of team multiplayer games (Q2196560) (← links)
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (Q2196563) (← links)
- Mario Kart Is Hard (Q2958086) (← links)
- The complexity of speedrunning video games (Q3301017) (← links)
- Restricted Power - Computational Complexity Results for Strategic Defense Games (Q3305735) (← links)
- (Q3305736) (← links)
- Optimizing the Video Game Multi-Jump: Player Strategy, AI, and Level Design (Q4576577) (← links)
- Games, Puzzles and Treewidth (Q5042461) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- Push-Pull Block Puzzles are Hard (Q5283366) (← links)