A remoteness formula for generalized Wythoff games
Abstract
Smith's remoteness function records how long an impartial game lasts when the winner wins as quickly as possible and the loser delays defeat. For the generalized Wythoff game WYT(a,b), in which two positive integer parameters a and b determine which simultaneous removals from the two piles are allowed, we give a formula for the remoteness of every position, building on the known values at losing positions. The formula depends on two indices: a local index determined by the coordinates of the losing positions in a window of length b ending at the smaller pile, and the integer part of the pile difference divided by a. When b=1, complementary Beatty sequences make the local index explicit, which gives an explicit formula for WYT(a,1), including classical Wythoff's game. We also show that if each attempted move in a finite impartial game independently fails with a fixed probability and passes the turn, the probability that the player to move wins under optimal play is an explicit exponential function of remoteness. For every success probability strictly between $0$ and $1$, the optimal attempts are exactly the moves that reduce remoteness by one.
Related
- Stability of ideal Nash equilibrium points in generalized multi-criteria games, interval-valued games, and existence in single-leader--multi-follower problems
- Addendum: On generalized canonical bundle formula and boundedness of complements in complex analytic setting
- Proofs of some OEIS conjectures on Wythoff sums, Fibonacci and Lucas words
- Bayesian Equilibria of Heterogeneous Non-Atomic Routing Games With Private Information
- From microscopic damage to macroscopic games: a dimensionality reduction of stem cell homeostasis
BibTeX
@misc{galan2026remoteness,
title = {{A remoteness formula for generalized Wythoff games}},
author = {Raúl Sánchez Galán and Yijie Xu},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.30427},
eprint = {2610.30427},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.30427},
}
RIS
TY - UNPB
TI - A remoteness formula for generalized Wythoff games
AU - Raúl Sánchez Galán
AU - Yijie Xu
PY - 2026
DA - 2026/10/21
PB - arXiv
DO - 10.48550/arxiv.2610.30427
UR - https://arxiv.org/abs/2610.30427
AB - Smith's remoteness function records how long an impartial game lasts when the winner wins as quickly as possible and the loser delays defeat. For the generalized Wythoff game WYT(a,b), in which two positive integer parameters a and b determine which simultaneous removals from the two piles are allowed, we give a formula for the remoteness of every position, building on the known values at losing positions. The formula depends on two indices: a local index determined by the coordinates of the losing positions in a window of length b ending at the smaller pile, and the integer part of the pile difference divided by a. When b=1, complementary Beatty sequences make the local index explicit, which gives an explicit formula for WYT(a,1), including classical Wythoff's game. We also show that if each attempted move in a finite impartial game independently fails with a fixed probability and passes the turn, the probability that the player to move wins under optimal play is an explicit exponential function of remoteness. For every success probability strictly between $0$ and $1$, the optimal attempts are exactly the moves that reduce remoteness by one.
ER -