When are translations of P-positions of Wythoff's game P-positions?

preprint2014arXivOpen access

Abstract

We study the problem whether there exist variants of {\sc Wythoff}'s game whose -positions, except for a finite number, are obtained from those of {\sc Wythoff}'s game by adding a constant kk to each -position. We solve this question by introducing a class $\{\W_k\}_{k \geq 0}$ of variants of {\sc Wythoff}'s game in which, for any fixed k≥0k \geq 0, the -positions of $\W_k$ form the set {(i,i)∣0≤i<k}∪{(⌊ϕn⌋+k,⌊ϕ2n⌋+k)∣n≥0}\{(i,i) | 0 \leq i < k\}\cup \{(\lfloor ϕn \rfloor + k, \lfloor ϕ^2 n \rfloor + k) | n\ge 0\}, where ϕϕ is the golden ratio. We then analyze a class $\{\T_k\}_{k \geq 0}$ of variants of {\sc Wythoff}'s game whose members share the same -positions set {(0,0)}∪{(⌊ϕn⌋+1,⌊ϕ2n⌋+1)∣n≥0}\{(0,0)\}\cup \{(\lfloor ϕn \rfloor + 1, \lfloor ϕ^2 n \rfloor + 1) | n \geq 0 \}. We establish several results for the Sprague-Grundy function of these two families. On the way we exhibit a family of games with different rule sets that share the same set of -positions.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.