How to Beat Your Wythoff Games' Opponent on Three Fronts
From MaRDI portal
Publication:4740359
DOI10.2307/2321643zbMATH Open0504.90087OpenAlexW4238010401MaRDI QIDQ4740359FDOQ4740359
Authors: Aviezri S. Fraenkel
Publication date: 1982
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2321643
Cited In (42)
- Multi-player Wythoff's game and its variants
- Computational Hardness of Multidimensional Subtraction Games
- Cubic pisot unit combinatorial games
- Variants of \((s, t)\)-Wythoff's game
- Two variants of Wythoff's game preserving its \(\mathcal P\)-positions
- A morphic approach to combinatorial games: the Tribonacci case
- On tame, pet, domestic, and miserable impartial games
- Invariant games
- A new heap game
- Complexity, appeal and challenges of combinatorial games
- The use and usefulness of numeration systems
- Adjoining to Wythoff's game its P-positions as moves
- Heap games, numeration systems and sequences
- Polynomial time winning strategies for three variants of \((s,t)\)-Wythoff's game
- On the misere version of game Euclid and miserable games
- Multi-player subtraction games
- Games played by Boole and Galois
- Nonhomogeneous Beatty sequences leading to invariant games
- Sumsets associated with Wythoff sequences and Fibonacci numbers
- General restriction of \((s,t)\)-Wythoff's game
- Sumsets associated with Beatty sequences
- Adjoining to \((s,t)\)-Wythoff's game its \(P\)-positions as moves
- The Sprague-Grundy function for Wythoff's game
- From combinatorial games to shape-symmetric morphisms
- Rulesets for Beatty games
- Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions
- Geometrical extensions of Wythoff's game
- Euclid and Wythoff games
- A class of extensions of restricted (\(s\), \(t\))-Wythoff's game
- A two-parameter family of an extension of Beatty sequences
- On cardinality of character sums with Beatty sequences associated with composite modules
- Iterated Floor Function, Algebraic Numbers, Discrete Chaos, Beatty Subsequences, Semigroups
- Stability for Take-Away Games
- A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory
- Further generalizations of the Wythoff game and the minimum excludant
- \(a\)-Wythoff's game with \(n\) players
- Self-similarity of \(\mathcal{P}\)-positions of \((2n+1)\)-dimensional Wythoff's game
- Vertex Nim played on graphs
- Wythoff's sequence and \(N\)-heap Wythoff's conjectures
- Adjoining to (K,s,t)-Wythoff's game its P-generators as moves
- Patterns in the generalized Fibonacci word, applied to games
- Extensions of the combinatorial game \(( K , t )\)-Wythoff
This page was built for publication: How to Beat Your Wythoff Games' Opponent on Three Fronts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4740359)