scientific article
From MaRDI portal
Publication:2703803
zbMath1005.00004MaRDI QIDQ2703803
Richard K. Guy, Elwyn R. Berlekamp
Publication date: 18 March 2001
Full work available at URL: https://www.taylorfrancis.com/books/9781568815947
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Positional games (pursuit and evasion, etc.) (91A24) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01) Recreational mathematics (00A08)
Related Items (only showing first 100 items - show all)
\(i\)-\textsc{Mark}: a new subtraction division game ⋮ Combinatorial game distributions of Steiner systems ⋮ Invertibility modulo dead-ending no-\(\mathcal{P}\)-universes ⋮ On the computational complexities of various geography variants ⋮ The graph distance game and some graph operations ⋮ Strategies in Games: A Logic-Automata Study ⋮ Solitaire clobber ⋮ Periodicity and arithmetic-periodicity in hexadecimal games ⋮ \(p\)-saturations of Welter's game and the irreducible representations of symmetric groups ⋮ Algorithms for interactive Sprouts ⋮ Guaranteed scoring games ⋮ Grundy values of Fibonacci Nim ⋮ Misère-play Hackenbush sprigs ⋮ J. H. Conway and the end of the story of numbers ⋮ On the additive period length of the Sprague-Grundy function of certain Nim-like games ⋮ P-positions in modular extensions to Nim ⋮ Adjoining to (K,s,t)-Wythoff's game its P-generators as moves ⋮ Combinatorial analysis of a subtraction game on graphs ⋮ The Sprague-Grundy functions of saturations of misère Nim ⋮ Friendly Frogs, Stable Marriage, and the Magic of Invariance ⋮ A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory ⋮ Cookie Monster Plays Games ⋮ Vertex Nim played on graphs ⋮ Timber game as a counting problem ⋮ \textsc{polish} -- Let us play the cleaning game ⋮ Unnamed Item ⋮ The invertible elements of the monoid of dead-ending misère games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Order-disorder transition in the Chialvo-Bak `minibrain' controlled by network geometry ⋮ Dynamical conflict models. I. Language of modeling ⋮ Unnamed Item ⋮ General restriction of \((s,t)\)-Wythoff's game ⋮ Taking-and-merging games as rewrite games ⋮ A base-p Sprague-Grundy type theorem for p-calm subtraction games: Welter's game and representations of generalized symmetric groups ⋮ Partizan Subtraction Games ⋮ Nim with one or two dynamic restrictions ⋮ Multi-player small Nim with passes ⋮ Games on interval and permutation graph representations ⋮ Misère quotients for impartial games ⋮ Partition games ⋮ The Sprague-Grundy function of the game Euclid ⋮ On the Sprague-Grundy function of \textsc{Exact} \(k\)-\textsc{Nim} ⋮ Circular Nim games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Extensions of the combinatorial game \(( K , t )\)-Wythoff ⋮ A family of Nim-like arrays: the locator theorem ⋮ The domination game played on unions of graphs ⋮ Canonical forms of uptimals ⋮ Analysis of one pile misère Nim for two alliances ⋮ One-pile Nim games with arbitrarily many random players ⋮ Dicots, and a taxonomic ranking for misère games ⋮ The combinatorial game theory of well-tempered scoring games ⋮ Chomp on generalized Kneser graphs and others ⋮ On the Sprague-Grundy function of extensions of proper \textsc{nim} ⋮ Some remarks on End-Nim ⋮ On compatible matchings ⋮ Preface ⋮ Misère Nim with multi-player ⋮ One-pile misère Nim for three or more players ⋮ On pruning search trees of impartial games ⋮ The switch operators and push-the-button games: a sequential compound over rulesets ⋮ On mathematical games ⋮ A map of the \(P\)-positions in `NIM with a pass' played on heap sizes of at most four ⋮ Transitive avoidance games ⋮ Nimbers are inevitable ⋮ Hanabi is NP-hard, even for cheaters who look at their cards ⋮ \textsf{PSPACE}-complete two-color planar placement games ⋮ A generalization of \textsc{Arc-Kayles} ⋮ Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions ⋮ Avoider-enforcer: the rules of the game ⋮ On the complexity of computing winning strategies for finite poset games ⋮ Self-organized criticality in intertidal microphytobenthos patch patterns ⋮ Invariant games ⋮ Reviews ⋮ A variant of Nim ⋮ 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 ⋮ Androids Armed With Poisoned Chocolate Squares: Ideal Nim and Its Relatives ⋮ Dual proof generation for quantified Boolean formulas with a BDD-based solver ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\) ⋮ Lattices of games ⋮ Algebraic structure in a family of Nim-like arrays. ⋮ The toucher-isolator game ⋮ Nimlike games with generalized bases ⋮ The orthogonal colouring game ⋮ Wythoff's sequence and \(N\)-heap Wythoff's conjectures ⋮ Notes on the combinatorial game: graph Nim ⋮ Dynamical generalizations of the prime number theorem and disjointness of additive and multiplicative semigroup actions ⋮ A group from Hackenbush game ⋮ Book review of: F. Patras, The essence of numbers ⋮ Atomic weights and the combinatorial game of \textsc{bipass} ⋮ On the expansion of three-element subtraction sets
Uses Software
This page was built for publication:
