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

Abstract

We study the problem whether there exist variants of Wythoff's game whose -positions, except for a finite number, are obtained from those of Wythoff's game by adding a constant k to each -position. We solve this question by introducing a class \k\k ≥ 0 of variants of Wythoff's game in which, for any fixed k ≥ 0, the -positions of k form the set \(i,i) | 0 ≤ i < k\ \( φ n + k, φ2 n + k) | n 0\, where φ is the golden ratio. We then analyze a class \k\k ≥ 0 of variants of Wythoff's game whose members share the same -positions set \(0,0)\ \( φ n + 1, φ2 n + 1) | n ≥ 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…