arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.14973math.NT
收藏

广义Zeckendorf对策的获胜策略

Winning Strategies for Generalized Zeckendorf Game

Steven J. Miller, Eliel Sosis, Jingkai Ye

摘要:

Zeckendorf证明了每一个正整数$n$都可以唯一地写成不相邻的斐波那契数之和;类似的结果也适用于其他正线性递归序列。这些合法的分解可以用来构造一个以固定整数$n$开始的游戏,玩家轮流使用与给定递归关系相关的移动。游戏最终以一个独特的合法分解结束,走最后一步的玩家获胜。在斐波那契博弈中,参与者$2$拥有所有$n>2$的获胜策略。我们给出了两人$(c, k)$ -nacci博弈的一个非构造性证明,对于所有的$k$和足够大的$n$,当$c$为偶数时,参与者$1$有获胜策略,当$c$为奇数时,参与者$2$有获胜策略.有趣的是,拥有获胜策略的玩家可能早在$c + 1$回合就犯了一个错误,在这种情况下,其他玩家获得了获胜策略。此外,我们证明了对于参与人为$p \ge c + 2$的$(c, k)$ -nacci博弈,没有参与人对任何$n \ge 3c^2 + 6c + 3$都有获胜策略。在三人游戏$(1, 2)$ -nacci游戏中,我们发现了更严格的下限$n \ge 7$。然后,我们将结果从多人博弈推广到多联盟博弈,在一些特殊的多联盟博弈情况下,说明了哪个联盟有获胜策略或何时不存在获胜策略。

英文摘要:

Zeckendorf proved that every positive integer $n$ 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 $n$, 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 $2$ has the winning strategy for all $n>2$. We give a non-constructive proof that for the two-player $(c, k)$-nacci game, for all $k$ and sufficiently large $n$, Player $1$ has a winning strategy when $c$ is even and Player $2$ has a winning strategy when $c$ is odd. Interestingly, the player with the winning strategy can make a mistake as early as the $c + 1$ turn, in which case the other player gains the winning strategy. Furthermore, we proved that for the $(c, k)$-nacci game with players $p \ge c + 2$, no player has a winning strategy for any $n \ge 3c^2 + 6c + 3$. We find a stricter lower boundary, $n \ge 7$, in the case of the three-player $(1, 2)$-nacci game. Then we extend the result from the multiplayer game to multialliance games, showing which alliance has a winning strategy or when no winning strategy exists for some special cases of multialliance games.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑