A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory

DOI10.1007/s00182-012-0338-6zbMath1278.91028OpenAlexW2017633279WikidataQ59560511 ScholiaQ59560511MaRDI QIDQ378342

Vladimir Oudalov, Endre Boros, Vladimir A. Gurvich

Publication date: 11 November 2013

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00182-012-0338-6

zbMATH Keywords

asymptoticcombinatorial gamesWythoff's gamePerron-Frobenius theoryCollatz-Wielandt formulaimpartial gamesNim game

Mathematics Subject Classification ID

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

Related Items

Computational Hardness of Multidimensional Subtraction Games ⋮ Further generalizations of the Wythoff game and the minimum excludant ⋮ Ordinal sums of impartial games ⋮ On tame, pet, domestic, and miserable impartial games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Further generalizations of the Wythoff game and the minimum excludant
• Wythoff games, continued fractions, cedar trees and Fibonacci searches
• On tame, pet, domestic, and miserable impartial games
• Complexity, appeal and challenges of combinatorial games
• Restrictions of $m$-Wythoff Nim and $p$-complementary Beatty Sequences
• 2-Pile Nim with a Restricted Number of Move-Size Imitations
• How to Beat Your Wythoff Games' Opponent on Three Fronts