The following pages link to (Q4407717):
Displaying 8 items.
- Phutball is PSPACE-hard (Q410721) (← links)
- The complexity of flood filling games (Q692938) (← links)
- An algorithmic analysis of the Honey-Bee game (Q714789) (← links)
- \textsc{Hanano} puzzle is \textsf{NP}-hard (Q1730016) (← links)
- Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
- On the complexity of jelly-no-puzzle (Q2695482) (← links)
- Computational complexity of puzzles and related topics (Q6535387) (← links)
- Defying gravity and gadget numerosity: the complexity of the Hanano puzzle and beyond (Q6602331) (← links)
