Further generalizations of the Wythoff game and the minimum excludant
From MaRDI portal
Publication:423891
DOI10.1016/j.dam.2012.01.009zbMath1241.91028OpenAlexW2051366817MaRDI QIDQ423891
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.01.009
combinatorial gamesimpartial gamesSprague-Grundy functionfraenkel NIMminimal excludantNIMnormal and misère versionsWythoff NIM
Related Items (7)
Adjoining to (K,s,t)-Wythoff's game its P-generators as moves ⋮ A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory ⋮ Verification and generation of unrefinable partitions ⋮ Extensions of the combinatorial game \(( K , t )\)-Wythoff ⋮ Ordinal sums of impartial games ⋮ On tame, pet, domestic, and miserable impartial games ⋮ SELF-SIMILARITY OF 𝒫-POSITIONS OF (2n + 1)-DIMENSIONAL WYTHOFF’S GAME
Cites Work
- A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory
- The vile, dopey, evil and odious game players
- Wythoff games, continued fractions, cedar trees and Fibonacci searches
- Misère annihilation games
- On the misere version of game Euclid and miserable games
- The Sprague-Grundy function for Wythoff's game
- On misere Nim-type games
- On sums of graph games with last player losing
- On tame, pet, domestic, and miserable impartial games
- Euclid and Wythoff games
- How to Beat Your Wythoff Games' Opponent on Three Fronts
- A Game Based on the Euclidean Algorithm and A Winning Strategy for it
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Further generalizations of the Wythoff game and the minimum excludant