A mathematical investigation of games of “take-away”

DOI10.1016/S0021-9800(66)80016-9zbMath0149.17002OpenAlexW2005420291WikidataQ29999343 ScholiaQ29999343MaRDI QIDQ5528371

Solomon W. Golomb

Publication date: 1966

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0021-9800(66)80016-9

zbMATH Keywords

Nim game

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial games (91A46)

Related Items (9)

Computational Hardness of Multidimensional Subtraction Games ⋮ Impartial games emulating one-dimensional cellular automata and undecidability ⋮ From heaps of matches to the limits of computability ⋮ The \(\star\)-operator and invariant subtraction games ⋮ From Combinatorial Games to Shape-Symmetric Morphisms ⋮ Patterns in the generalized Fibonacci word, applied to games ⋮ Rulesets for Beatty games ⋮ Nonhomogeneous Beatty Sequences Leading to Invariant Games ⋮ Faster Evaluation of Subtraction Games

This page was built for publication: A mathematical investigation of games of “take-away”