Winning Strategies for Generalized Zeckendorf Game
Steven J. Miller, Eliel Sosis, Jingkai Ye

TL;DR
This paper investigates winning strategies in generalized Zeckendorf games based on linear recurrence sequences, providing proofs of strategic dominance for players under various conditions and extending results to multiplayer alliances.
Contribution
It introduces new non-constructive proofs for winning strategies in generalized Zeckendorf games, including multiplayer and alliance scenarios, for various recurrence parameters.
Findings
Player 2 wins for Fibonacci game when n > 2.
Player 1 wins for even c in (c,k)-nacci game when n is large.
No player has a winning strategy for certain parameters with p ≥ c+2.
Abstract
Zeckendorf proved that every positive integer can be written uniquely as the sum of non-adjacent Fibonacci numbers; a similar result holds for other positive linear recurrence sequences. These legal decompositions can be used to construct a game that starts with a fixed integer , and players take turns using moves relating to a given recurrence relation. The game eventually terminates in a unique legal decomposition, and the player who makes the final move wins. For the Fibonacci game, Player has the winning strategy for all . We give a non-constructive proof that for the two-player -nacci game, for all and sufficiently large , Player has a winning strategy when is even and Player has a winning strategy when is odd. Interestingly, the player with the winning strategy can make a mistake as early as the turn, in which case the other…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Computability, Logic, AI Algorithms · Mathematical Dynamics and Fractals
