Combinatorial game theory
From MaRDI portal
Publication:2844833
Recommendations
- scientific article; zbMATH DE number 4176870
- Games of no chance 3. Papers from the workshop on combinatorial game theory, Banff, Canada, June 2005
- scientific article; zbMATH DE number 863512
- Impartial games with entailing moves
- Games of no chance 5. Papers of the BIRS workshop on combinatorial game theory, Banff, Canada, January 2011
Cited in
(97)- Patterns in the generalized Fibonacci word, applied to games
- Surreal ordered exponential fields
- Atomic weights and the combinatorial game of \textsc{bipass}
- The Sprague-Grundy function for some selective compound games
- The switch operators and push-the-button games: a sequential compound over rulesets
- Grundy numbers of impartial three-dimensional chocolate-bar games
- \(i\)-\textsc{Mark}: a new subtraction division game
- Extended Sprague-Grundy theory for locally finite games, and applications to random game-trees
- Embedding processes in combinatorial game theory
- A note on the eternal dominating set problem
- Partition games
- scientific article; zbMATH DE number 7306571 (Why is no real title available?)
- The polynomial profile of distance games on paths and cycles
- The combinatorial game \textsc{Nofil} played on Steiner triple systems
- Bounding game temperature using confusion intervals
- A generalization of \textsc{Arc-Kayles}
- scientific article; zbMATH DE number 16386 (Why is no real title available?)
- Algebraic games -- playing with groups and rings
- Impartial achievement and avoidance games for generating finite groups
- On tame, pet, domestic, and miserable impartial games
- Impartial achievement games on convex geometries
- Three-player \textsc{nim} with podium rule
- Games of no chance 3. Papers from the workshop on combinatorial game theory, Banff, Canada, June 2005
- Sprague-Grundy function of matroids and related hypergraphs
- Playing Games with Cacti
- Partizan subtraction games
- Thinning thickets
- Combinatorial game distributions of Steiner systems
- Playing impartial games on a simplicial complex as an extension of the emperor sum theory
- Connected subtraction games on subdivided stars
- The Sprague-Grundy functions of saturations of misère Nim
- scientific article; zbMATH DE number 7021370 (Why is no real title available?)
- A map of the \(P\)-positions in `NIM with a pass' played on heap sizes of at most four
- Ordinal sums of impartial games
- An algorithmic analysis of a combinatorial game
- scientific article; zbMATH DE number 7674558 (Why is no real title available?)
- scientific article; zbMATH DE number 7306576 (Why is no real title available?)
- Impartial achievement games for generating nilpotent groups
- Counting domineering positions
- Integration on the surreals
- Backsliding toads and frogs
- Special issue on combinatorial game theory
- On lattices from combinatorial game theory: infinite case
- Games of no chance 5. Papers of the BIRS workshop on combinatorial game theory, Banff, Canada, January 2011
- Ordinal sums, \textsc{clockwise hackenbush} and \textsc{domino shave}
- Playing Bynum's game cautiously
- Subtraction games in more than one dimension
- Sprague-Grundy theory in bounded arithmetic
- Book review of: E. R. Berlekamp et al., Winning ways for your mathematical plays.
- Lessons in play. An introduction to combinatorial game theory
- \textsc{influence}: a partizan scoring game on graphs
- Maker-breaker total domination game
- A note on numbers
- From combinatorial games to shape-symmetric morphisms
- Combinatorics of \textsc{jenga}
- Atomic weight calculus of spindly games
- An extension of the normal play convention to \(N\)-player combinatorial games
- Entrepreneurial chess
- Games with guaranteed scores and waiting moves
- Sterling Stirling play
- Wythoff partizan subtraction
- scientific article; zbMATH DE number 7447795 (Why is no real title available?)
- Bidding combinatorial games
- Sprague-Grundy values and complexity for LCTR
- Bipartite instances of INFLUENCE
- Combinatorial game theory. A special collection in honor of Elwyn Berlekamp, John H. Conway and Richard K. Guy
- Indecomposable combinatorial games
- Discrete Richman-bidding scoring games
- Positional games
- Impartial games with entailing moves
- Maker-Breaker domination game
- Combinatorial optimization in Nash games
- Taking-and-merging games as rewrite games
- Preface. To the three forefathers of combinatorial game theory: the John Conway, Richard Guy, and Elwyn Berlekamp memorial volume
- A codex of \(\mathcal{N}\)- and \(\mathcal{P}\)-positions in Harary's `caterpillar game'
- Disjunctive sums of quasi-nimbers
- Relator Games on Groups
- Combinatorial games on a graph
- scientific article; zbMATH DE number 5133448 (Why is no real title available?)
- Dicots, and a taxonomic ranking for misère games
- Octal games on graphs: the game 0.33 on subdivided stars and bistars
- Simplicial complexes are game complexes
- A complete solution for a nontrivial ruleset with entailing moves
- Canonical forms of uptimals
- scientific article; zbMATH DE number 7633013 (Why is no real title available?)
- Pyramid Nim
- Two-player tower of Hanoi
- Coping with cycles
- Impartial hypergraph games
- Timber game as a counting problem
- On the structure of misère impartial games
- Walks: a beginner's guide to graphs and matrices
- The game of flipping coins
- The spectrum of nim-values for achievement games for generating finite groups
- Some notes on disjunctive short sum: \textsc{polychromatic nim}
- A variant of Nim played on Boolean matrices
- Some transfinite natural sums
This page was built for publication: Combinatorial game theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2844833)
