scientific article; zbMATH DE number 1944394
From MaRDI portal
Publication:4407697
Recommendations
Cited in
(12)- PSPACE-Hardness of some combinatorial games
- The Othello game on an \(n\times n\) board is PSPACE-complete
- Complexity, appeal and challenges of combinatorial games
- scientific article; zbMATH DE number 988835 (Why is no real title available?)
- Combinatorial pawn power.
- Phutball is PSPACE-hard
- scientific article; zbMATH DE number 1759687 (Why is no real title available?)
- scientific article; zbMATH DE number 1759688 (Why is no real title available?)
- Playing Savitch and cooking games
- Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem
- A tractability gap beyond nim-sums: it's hard to tell whether a bunch of superstars are losers
- An algorithmic analysis of the Honey-Bee game
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4407697)