Euclid and Wythoff games (Q2576836)

In the game Euclid on two positive integers, a move consists of decreasing the larger integer by any positive multiple of the smaller, as long as the result remains positive. The first player unable to move loses. For an integer \(n>0\), the generalized Wythoff game \(GW_n\) on two nonnegative integers, the moves are of two types: (i) decreasing one of the numbers by a positive integer, leaving the result nonnegative; (ii) decreasing one of the numbers by an integer \(k>0\) and the other by an integer \(l>0\), with \(| k-l| <n\). The player unable to move because the position is (0,0) loses. Winning strategies for both have been previously given. In this paper the author gives two characterizations of the Sprague-Grundy function values for Euclid in terms of the winning strategy of \(GW_n\).