How to Beat Your Wythoff Games' Opponent on Three Fronts
From MaRDI portal
(Redirected from Publication:4740359)
Cited in
(48)- Cubic pisot unit combinatorial games
- Geometrical extensions of Wythoff's game
- The use and usefulness of numeration systems
- Adjoining to Wythoff's game its P-positions as moves
- Heap games, numeration systems and sequences
- A new heap game
- Patterns in the generalized Fibonacci word, applied to games
- On tame, pet, domestic, and miserable impartial games
- Rulesets for Beatty games
- Complexity, appeal and challenges of combinatorial games
- Multi-player Wythoff's game and its variants
- Sumsets associated with Wythoff sequences and Fibonacci numbers
- Sumsets associated with Beatty sequences
- Adjoining to (K,s,t)-Wythoff's game its P-generators as moves
- Extensions of the combinatorial game \(( K , t )\)-Wythoff
- Variants of (s, t)-Wythoff's game
- Games played by Boole and Galois
- Wythoff's sequence and \(N\)-heap Wythoff's conjectures
- Euclid and Wythoff games
- Nonhomogeneous Beatty sequences leading to invariant games
- A morphic approach to combinatorial games: the Tribonacci case
- 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
- Two variants of Wythoff's game preserving its P-positions
- Further generalizations of the Wythoff game and the minimum excludant
- Iterated Floor Function, Algebraic Numbers, Discrete Chaos, Beatty Subsequences, Semigroups
- Adjoining to \((s,t)\)-Wythoff's game its \(P\)-positions as moves
- Self-similarity of \(\mathcal{P}\)-positions of \((2n+1)\)-dimensional Wythoff's game
- Computational Hardness of Multidimensional Subtraction Games
- From combinatorial games to shape-symmetric morphisms
- Stability for Take-Away Games
- A class of extensions of restricted (\(s\), \(t\))-Wythoff's game
- \(a\)-Wythoff's game with \(n\) players
- On cardinality of character sums with Beatty sequences associated with composite modules
- Variants of Wythoff game with terminal positions or blocking maneuvers
- Anti-recurrence sequences
- Decomposition of Beatty and complementary sequences
- On Cloitre's hiccup sequences
- Automatic proofs in combinatorial game theory
- Computing remoteness functions of Moore, Wythoff, and Euclid's games
- Polynomial time winning strategies for three variants of \((s,t)\)-Wythoff's game
- Multi-player subtraction games
- On the misere version of game Euclid and miserable games
- The Sprague-Grundy function for Wythoff's game
- A two-parameter family of an extension of Beatty sequences
- Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions
- Invariant games
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)