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

Wythoff对策的基向量广义算法$(2^b,2^b)$

Generalized Algorithm for Wythoff's Game with Basis Vector $(2^b,2^b)$

Shubham Aggarwal, Jared Geller, Shuvom Sadhuka, Max Yu

摘要:

Wythoff's Game是Nim的一个变体,玩家可以从每堆石头中取出相同数量的石头,或者进行有效的Nim移动。W. A. Wythoff证明了Wythoff博弈的P-位置集(丢失位置)$C$由$C := \left\{ (\lfloor kϕ\rfloor, \lfloor kϕ^2 \rfloor), (\lfloor kϕ^2 \rfloor, \lfloor kϕ\rfloor) : k \in \mathbb Z_{\geq 0} \right\}$给出。一个开放的Wythoff问题仍然存在,玩家进行有效的尼姆移动或从每堆中删除$kb$石头,其中$b$是一个固定的整数。我们将其表示为$(b,b)$博弈。例如,常规的Wythoff游戏只是$(1,1)$游戏。在2009年,杜赫${ê}$ ne和Gravier证明了一种算法,通过利用两个桩之间的石头模$4$之间的差异的周期性,为$(2,2)$游戏生成P-位置集。我们观察到类似的循环行为的任何$b$,其中$b$是$2$,模$b^2$的权力,并构建一个算法来生成这个游戏的P-位置的集合。让$a$成为$2$的一种力量。我们证明了我们的算法的工作原理,首先表明,它适用于第一个$a^2$条款的$(a,a)$游戏。接下来,我们从$a^2$项构造了$(2a,2a)$博弈的有序多重集,并给出了归纳证明。此外,我们推测,所有的循环游戏需要$a$是$2$的一个权力,这表明在广义的$(b,b)$游戏中没有类似的结构,$b$不是$2$的一个权力。推广这一结果的未来方向可能会利用计数系统,特别是PV数。

英文摘要:

Wythoff's Game is a variation of Nim in which players may take an equal number of stones from each pile or make valid Nim moves. W. A. Wythoff proved that the set of P-Positions (losing position), $C$, for Wythoff's Game is given by $C := \left\{ (\lfloor kϕ\rfloor, \lfloor kϕ^2 \rfloor), (\lfloor kϕ^2 \rfloor, \lfloor kϕ\rfloor) : k \in \mathbb Z_{\geq 0} \right\}$. An open Wythoff problem remains where players make the valid Nim moves or remove $kb$ stones from each pile, where $b$ is a fixed integer. We denote this as the $(b,b)$ game. For example, regular Wythoff's Game is just the $(1,1)$ game. In 2009, Duch${ê}$ne and Gravier proved an algorithm to generate the set of P-Positions for the $(2,2)$ game by exploiting the periodic nature of the differences of stones between the two piles modulo $4$. We observe similar cyclic behaviour for any $b$, where $b$ is a power of $2$, modulo $b^2$, and construct an algorithm to generate the set of P-Positions for this game. Let $a$ be a power of $2$. We prove our algorithm works by first showing that it holds for the first $a^2$ terms in the $(a,a)$ game. Next, we construct an ordered multiset for the $(2a,2a)$ game from the $a^2$ terms, and an inductive proof follows. Moreover, we conjecture that all cyclic games require $a$ to be a power of $2$, suggesting that there is no similar structure in the generalised $(b,b)$ game where $b$ isn't a power of $2$. Future directions for generalising this result would likely utilise numeration systems, particularly the PV numbers.

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

↑