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

DOI10.1007/S00182-012-0338-6zbMATH Open1278.91028DBLPjournals/ijgt/BorosGO13OpenAlexW2017633279WikidataQ59560511 ScholiaQ59560511MaRDI QIDQ378342FDOQ378342

Vladimir Oudalov, Endre Boros, Vladimir 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 gamesPerron-Frobenius theoryCollatz-Wielandt formulaimpartial gamesNim gameWythoff's game

Mathematics Subject Classification ID

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

Cites Work

• Winning ways for your mathematical plays. Vol. 1.
• Title not available (Why is that?)
• Title not available (Why is that?)
• On tame, pet, domestic, and miserable impartial games
• Complexity, appeal and challenges of combinatorial games
• Title not available (Why is that?)
• Restrictions of $m$-Wythoff Nim and $p$-complementary Beatty Sequences
• Title not available (Why is that?)
• 2-Pile Nim with a Restricted Number of Move-Size Imitations
• Further generalizations of the Wythoff game and the minimum excludant
• How to Beat Your Wythoff Games' Opponent on Three Fronts
• Wythoff games, continued fractions, cedar trees and Fibonacci searches

Cited In (5)

• Computational Hardness of Multidimensional Subtraction Games
• On tame, pet, domestic, and miserable impartial games
• Ordinal sums of impartial games
• Further generalizations of the Wythoff game and the minimum excludant
• On the recurrence \(f_{m+1}=b_m f_m-f_{m-1}\) and applications

This page was built for publication: A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378342)