Pages that link to "Item:Q3305729"
From MaRDI portal
The following pages link to Computational complexity of generalized Push Fight (Q3305729):
Displaying 5 items.
- Phutball is PSPACE-hard (Q410721) (← links)
- Generalized Pete's Pike is PSPACE-complete (Q899314) (← links)
- On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games (Q3305726) (← links)
- Magic: The Gathering is Turing complete (Q6487576) (← links)
- The computational complexity of Evil Hangman (Q6487596) (← links)