Publication:4827118

From MaRDI portal
Revision as of 02:59, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


zbMath1084.00002MaRDI QIDQ4827118

Conway, John H., Elwyn R. Berlekamp, Richard K. Guy

Publication date: 16 November 2004



00A69: General applied mathematics

91A24: Positional games (pursuit and evasion, etc.)

00A08: Recreational mathematics


Related Items

Preface, Unnamed Item, Statistical Challenges in Agent-Based Modeling, Counting Domineering Positions, The Complexity of Poset Games, The Polynomial Profile of Distance Games on Paths and Cycles, Sprague-Grundy values and complexity for LCTR, Bidding combinatorial games, A classification of one-dimensional cellular automata using infinite computations, Three-pile Sharing Nim and the quadratic time winning strategy, One pile misère bounded Nim with two alliances, Analyzing \(n\)-player impartial games, Adjoining to \((s,t)\)-Wythoff's game its \(P\)-positions as moves, General restrictions of Wythoff-like games, A class of extensions of restricted (\(s\), \(t\))-Wythoff's game, Multi-player subtraction games, Winning strategies for aperiodic subtraction games, RealLife: the continuum limit of larger than life cellular automata, On the misere version of game Euclid and miserable games, Defect particle kinematics in one-dimensional cellular automata, Invisible runners in finite fields, All solutions of the Soma cube puzzle, The vertex picking game and a variation of the game of dots and boxes, The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar games, A simple proof that the \((n^{2} - 1)\)-puzzle is hard, Multi-player End-Nim games, Game comparison through play, Note on the integer geometry of bitwise XOR, Octal games on graphs: the game 0.33 on subdivided stars and bistars, Assessing the robustness of critical behavior in stochastic cellular automata, The Penney's game with group action, Bounding game temperature using confusion intervals, Discrete Richman-bidding scoring games, Queens in exile: non-attacking queens on infinite chess boards, Simplicial complexes are game complexes, Sprague-Grundy function of matroids and related hypergraphs, Reversible peg solitaire on graphs, Variants of \((s, t)\)-Wythoff's game, Sprague-Grundy function of symmetric hypergraphs, Morphisms for resistive electrical networks, Games played by Boole and Galois, Computational power of infinite quantum parallelism, \(n\)-player impartial combinatorial games with random players, Quantum extensive-form games, Sequentially Swapping Colored Tokens on Graphs, Unnamed Item


Uses Software