The Sprague-Grundy function for Wythoff's game

DOI10.1016/0304-3975(90)90098-3zbMath0701.68037OpenAlexW2159565584MaRDI QIDQ914374

Uri Blass, Aviezri S. Fraenkel

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90098-3

zbMATH Keywords

Wythoff's gameSprague-Grundy function

Mathematics Subject Classification ID

2-person games (91A05) Parallel algorithms in computer science (68W10)

Related Items

Complexity, appeal and challenges of combinatorial games ⋮ Three-pile Sharing Nim and the quadratic time winning strategy ⋮ On the misere version of game Euclid and miserable games ⋮ Cookie Monster Plays Games ⋮ Two variants of Wythoff's game preserving its \(\mathcal P\)-positions ⋮ Further generalizations of the Wythoff game and the minimum excludant ⋮ From Combinatorial Games to Shape-Symmetric Morphisms ⋮ On pruning search trees of impartial games ⋮ Games played by Boole and Galois ⋮ On tame, pet, domestic, and miserable impartial games ⋮ Geometrical extensions of Wythoff's game ⋮ Algebraic structure in a family of Nim-like arrays. ⋮ Additive periodicity of the Sprague-Grundy function of certain Nim games ⋮ Sprague-Grundy values of the \(\mathcal{R}\)-Wythoff game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonhomogeneous spectra of numbers
• A linear algorithm for nonhomogeneous spectra of numbers
• Spectra of Numbers
• How to Beat Your Wythoff Games' Opponent on Three Fronts

This page was built for publication: The Sprague-Grundy function for Wythoff's game