Publication:4827118
From MaRDI portal
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
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, Simplicial complexes are game complexes, 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, Sequentially Swapping Colored Tokens on Graphs
Uses Software
