Wythoff partizan subtraction (Q1791294)

The authors study solution for a class of two-player subtraction games. Subtraction games are zero-sum games with the following structure: there is a finite set of heaps of counters, and the players take turns to choose a heap and decide how many counters to remove from it. Each player has a subtraction set, which specifies the allowable numbers of counters to remove that he can choose from. A player who has no allowable moves loses. The authors consider partizan games, meaning that the players have different subtraction sets. The topic of the paper is complementary subtraction games, where one player has a subtraction set A and the other player's subtraction set B is all the positive integers not in A. The focus specifically is on the case where A and B are taken from \textit{W. A. Wythoff}'s sequences [Nieuw Arch. Wiskd., II. Ser. 7, 199--202 (1906; JFM 37.0261.03)]. The authors characterize the winning positions for each player in such games, using properties of the Fibonacci sequence.