Winning Strategy for the Multiplayer and Multialliance Zeckendorf Games

zbMATH Open1503.91038arXiv2009.03708MaRDI QIDQ5077313FDOQ5077313

Authors: Anna Cusenza, Aidan Dunkelberg, Kate Huffman, Dianhui Ke, Daniel Kleber, Steven J. Miller, Clayton M. Mizgerd, Vashisth Tiwari, Jingkai Ye, Xiaoyan Zheng 

Publication date: 18 May 2022

Abstract: Edouard Zeckendorf proved that every positive integer $n$ can be uniquely written cite{Ze} as the sum of non-adjacent Fibonacci numbers, known as the Zeckendorf decomposition. Based on Zeckendorf's decomposition, we have the Zeckendorf game for multiple players. We show that when the Zeckendorf game has at least $3$ players, none of the players have a winning strategy for $ngeq5$. Then we extend the multi-player game to the multi-alliance game, finding some interesting situations in which no alliance has a winning strategy. This includes the two-alliance game, and some cases in which one alliance always has a winning strategy. %We examine what alliances, or combinations of players, can win, and what size they have to be in order to do so. We also find necessary structural constraints on what alliances our method of proof can show to be winning. Furthermore, we find some alliance structures which must have winning strategies. %We also extend the Generalized Zeckendorf game from $2$-players to multiple players. We find that when the game has $3$ players, player $2$ never has a winning strategy for any significantly large $n$. We also find that when the game has at least $4$ players, no player has a winning strategy for any significantly large $n$.

Full work available at URL: https://arxiv.org/abs/2009.03708

Recommendations

• scientific article; zbMATH DE number 7676368
• scientific article; zbMATH DE number 7663184
• On winning strategies in Ehrenfeucht-Fraïssé games
• The generalized Zeckendorf game
• scientific article; zbMATH DE number 758200
• Optimal strategies of multi-player large Nim games
• Additional winning strategies in reachability games
• Efficient winning strategies in random-turn maker-breaker games
• Structure coefficients and strategy selection in multiplayer games

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Combinatorial games (91A46)

Cited In (6)

• Title not available (Why is that?)
• Deterministic Zeckendorf games
• The accelerated Zeckendorf game
• EA2: The Winning Strategy for the Inaugural Lemonade Stand Game Tournament
• Title not available (Why is that?)
• Bounds on Zeckendorf games

This page was built for publication: Winning Strategy for the Multiplayer and Multialliance Zeckendorf Games

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