scientific article; zbMATH DE number 3124339
From MaRDI portal
Publication:3239652
Cited in
(26)- On the complexity of some two-person perfect-information games
- Misère quotients for impartial games
- From combinatorial games to shape-symmetric morphisms
- On pruning search trees of impartial games
- Partition games
- A generalization of \textsc{Arc-Kayles}
- Extended Sprague-Grundy theory for locally finite games, and applications to random game-trees
- Arrays, numeration systems and Frankenstein games
- A new heap game
- Heap games, numeration systems and sequences
- On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints
- Complexity, appeal and challenges of combinatorial games
- Lattice games without rational strategies
- Dawson's chess revisited
- Preface
- Algorithms for lattice games
- Sums of Zuchswang games
- A note on periodicity in some octal games
- Partizan octal games: Partizan subtraction games
- The projectivity of Y-games
- Lattice point methods for combinatorial games
- On the structure of misère impartial games
- On sums of graph games with last player losing
- Sequential compounds of combinatorial games
- Mathematical Kayles
- Genetically modified games
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 Q3239652)
