A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory
From MaRDI portal
(Redirected from Publication:378342)
Recommendations
Cites work
- scientific article; zbMATH DE number 3521877 (Why is no real title available?)
- scientific article; zbMATH DE number 3084373 (Why is no real title available?)
- 2-pile Nim with a restricted number of move-size imitations
- Complexity, appeal and challenges of combinatorial games
- Further generalizations of the Wythoff game and the minimum excludant
- Harnessing the unwieldy MEX function
- How to Beat Your Wythoff Games' Opponent on Three Fronts
- On tame, pet, domestic, and miserable impartial games
- Permutations of the natural numbers with prescribed difference multisets
- Restrictions of $m$-Wythoff Nim and $p$-complementary Beatty Sequences
- Winning ways for your mathematical plays. Vol. 1.
- Wythoff games, continued fractions, cedar trees and Fibonacci searches
Cited in
(5)
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)