Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem
From MaRDI portal
Publication:6562875
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1944394 (Why is no real title available?)
- scientific article; zbMATH DE number 3020856 (Why is no real title available?)
- A Combinatorial Problem Which Is Complete in Polynomial Space
- A Nim game played on graphs.
- A PSPACE-complete graph nim
- Atropos: a PSPACE-complete Sperner triangle game
- Chomp, Recurrences and Chaos(?)
- Complexity, appeal and challenges of combinatorial games
- Computing a perfect strategy for nxn chess requires time exponential in n
- Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
- GO Is Polynomial-Space Hard
- Hex ist Pspace-vollständig. (Hex is Pspace-complete)
- Impartial coloring games
- Nim, a game with a complete mathematical theory.
- On the complexity of computing winning strategies for finite poset games
- On the complexity of some two-person perfect-information games
- On the structure of misère impartial games
- The Game of Hex and the Brouwer Fixed-Point Theorem
- The role of quantum correlations in cop and robber game
- UNO is hard, even for a single player
- Undirected edge geography
- Winning ways for your mathematical plays. Vol. 1.
- \textsc{Transverse wave}: an impartial color-propagation game inspired by social influence and quantum NIM
This page was built for publication: Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562875)
