Publication:2703803
From MaRDI portal
zbMath1005.00004MaRDI QIDQ2703803
Conway, John H., Richard K. Guy, Elwyn R. Berlekamp
Publication date: 18 March 2001
Full work available at URL: https://www.taylorfrancis.com/books/9781568815947
91A24: Positional games (pursuit and evasion, etc.)
91-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance
00A08: Recreational mathematics
Related Items
Friendly Frogs, Stable Marriage, and the Magic of Invariance, Cookie Monster Plays Games, Androids Armed With Poisoned Chocolate Squares: Ideal Nim and Its Relatives, Unnamed Item, Unnamed Item, Unnamed Item, Quasiperfect numbers with the same exponent, A Probabilistic Two-Pile Game, A vertex and edge deletion game on graphs, \(i\)-\textsc{Mark}: a new subtraction division game, The graph distance game and some graph operations, Algorithms for interactive Sprouts, Guaranteed scoring games, Grundy values of Fibonacci Nim, Misère-play Hackenbush sprigs, A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory, Vertex Nim played on graphs, General restriction of \((s,t)\)-Wythoff's game, The domination game played on unions of graphs, Dicots, and a taxonomic ranking for misère games, Misère Nim with multi-player, Transitive avoidance games, Hanabi is NP-hard, even for cheaters who look at their cards, On the complexity of computing winning strategies for finite poset games, Canonical forms of uptimals, Analysis of one pile misère Nim for two alliances, Some remarks on End-Nim, The switch operators and push-the-button games: a sequential compound over rulesets, Nimbers are inevitable, Self-organized criticality in intertidal microphytobenthos patch patterns, A variant of Nim, Lattices of games, Dynamical conflict models. I. Language of modeling, Nim with one or two dynamic restrictions, Games on interval and permutation graph representations, Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions, Avoider-enforcer: the rules of the game, Invariant games, Algebraic structure in a family of Nim-like arrays., Order-disorder transition in the Chialvo-Bak `minibrain' controlled by network geometry, Invertibility modulo dead-ending no-\(\mathcal{P}\)-universes, \(p\)-saturations of Welter's game and the irreducible representations of symmetric groups, Multi-player small Nim with passes, On the Sprague-Grundy function of \textsc{Exact} \(k\)-\textsc{Nim}, One-pile Nim games with arbitrarily many random players, A map of the \(P\)-positions in `NIM with a pass' played on heap sizes of at most four, Entrepreneurial chess, Algebraic games -- playing with groups and rings, A note on the eternal dominating set problem, Wythoff partizan subtraction, Games with guaranteed scores and waiting moves, Impartial poker nim, Solitaire clobber, Periodicity and arithmetic-periodicity in hexadecimal games, \textsc{polish} -- Let us play the cleaning game, Circular Nim games, \textsf{PSPACE}-complete two-color planar placement games, A generalization of \textsc{Arc-Kayles}, The toucher-isolator game, The orthogonal colouring game, On the expansion of three-element subtraction sets, P-positions in modular extensions to Nim, Combinatorial analysis of a subtraction game on graphs, Timber game as a counting problem, Misère quotients for impartial games, The Sprague-Grundy function of the game Euclid, A family of Nim-like arrays: the locator theorem, The combinatorial game theory of well-tempered scoring games, One-pile misère Nim for three or more players, Nimlike games with generalized bases, Wythoff's sequence and \(N\)-heap Wythoff's conjectures, On mathematical games, Strategies in Games: A Logic-Automata Study
Uses Software
