Pages that link to "Item:Q5958338"
From MaRDI portal
The following pages link to Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants'' (Q5958338):
Displaying 24 items.
- Phutball is PSPACE-hard (Q410721) (← links)
- \textsc{Snowman} is \(\mathsf{PSPACE}\)-complete (Q526872) (← links)
- Generalized Pete's Pike is PSPACE-complete (Q899314) (← links)
- Trainyard is NP-hard (Q1623273) (← links)
- Assembling molecules in ATOMIX is hard (Q1885003) (← links)
- Tracks from hell -- when finding a proof may be easier than checking it (Q2196558) (← links)
- Wooden geometric puzzles: Design and hardness proofs (Q2272190) (← links)
- The computational complexity of Angry Birds (Q2302303) (← links)
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation (Q2570127) (← links)
- Tracks from hell - When finding a proof may be easier than checking it (Q3305722) (← links)
- On the Complexity of Two Dots for Narrow Boards and Few Colors. (Q3305725) (← links)
- Randolphs Robot Game is NP-hard! (Q3439467) (← links)
- LaserTank is NP-Complete (Q5014691) (← links)
- Games, Puzzles and Treewidth (Q5042461) (← links)
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch (Q5115797) (← links)
- Playing Savitch and Cooking Games (Q5187817) (← links)
- Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch (Q5203793) (← links)
- Push-Pull Block Puzzles are Hard (Q5283366) (← links)
- Parameterized Complexity of Graph Constraint Logic (Q5363782) (← links)
- Fixed-parameter algorithms for graph constraint logic (Q6041672) (← links)
- (Q6065436) (← links)
- (Q6089660) (← links)
- \(1\times 1\) Rush Hour with fixed blocks is PSPACE-complete (Q6487573) (← links)
- Artificial intelligence and high-level cognition (Q6602274) (← links)
