Subtract a square

A normal play game starting with 13 coins is a win for the first player provided they start with a subtraction of 1:

player 1: 13 - 1*1 = 12

Player 2 now has three choices: subtract 1, 4 or 9. In each of these cases, player 1 can ensure that within a few moves the number 2 gets passed on to player 2:

player 2: 12 - 1*1 = 11        player 2:       12 - 2*2 = 8               player 2: 12 - 3*3 = 3
player 1: 11 - 3*3 =  2        player 1:        8 - 1*1 = 7               player 1:  3 - 1*1 = 2
                               player 2:  7 - 1*1 = 6 or: 7 - 2*2 = 3   
                               player 1:  6 - 2*2 = 2     3 - 1*1 = 2

Now player 2 has to subtract 1, and player 1 subsequently does the same:

player 2:  2 - 1*1 = 1
player 1:  1 - 1*1 = 0
  player 2 loses

In the above example, the number '13' represents a winning or 'hot' position, whilst the number '2' represents a losing or 'cold' position. Given an integer list with each integer labeled 'hot' or 'cold', the strategy of the game is simple: try to pass on a 'cold' number to your opponent. This is always possible provided you are being presented a 'hot' number. Which numbers are 'hot' and which numbers are 'cold' can be determined recursively:

1. the number 0 is 'cold', whilst 1 is 'hot'
2. if all numbers 1 .. N have been classified as either 'hot' or 'cold', then
   • the number N+1 is 'cold' if only 'hot' numbers can be reached by subtracting a positive square
   • the number N+1 is 'hot' if at least one 'cold' number can be reached by subtracting a positive square

Using this algorithm, a list of cold numbers is easily derived:

0, 2, 5, 7, 10, 12, 15, 17, 20, 22, 34, 39, 44, … (sequence A030193 in the OEIS)

A faster divide and conquer algorithm can compute the same sequence of numbers, up to any threshold ${\displaystyle n}$, in time ${\displaystyle O(n\log ^{2}n)}$.[4]

There are infinitely many cold numbers. More strongly, the number of cold numbers up to some threshold ${\displaystyle n}$ must be at least proportional to the square root of ${\displaystyle n}$, for otherwise there would not be enough of them to provide winning moves from all the hot numbers.[3] Cold numbers tend to end in 0, 2, 4, 5, 7, or 9. Cold values that end with other digits are quite uncommon.[3] This holds in particular for cold numbers ending in 6. Out of all the over 180,000 cold numbers less than 40 million, only one ends in a 6: 11,356.[5]

No two cold numbers can differ by a square, because if they did then a move from the larger of the two to the smaller would be winning, contradicting the assumption that they are both cold. Therefore, by the Furstenberg–Sárközy theorem, the natural density of the cold numbers is zero. That is, for every ${\displaystyle \epsilon >0}$, and for all sufficiently large ${\displaystyle n}$, the fraction of the numbers up to ${\displaystyle n}$ that are cold is less than ${\displaystyle \epsilon }$. More strongly, for every ${\displaystyle n}$ there are

${\displaystyle O(n/(\log n)^{{\frac {1}{4}}\log \log \log \log n})}$

cold numbers up to ${\displaystyle n}$.[6] The exact growth rate of the cold numbers remains unknown, but experimentally the number of cold positions up to any given threshold ${\displaystyle n}$ appears to be roughly ${\displaystyle n^{0.7}}$.[4]

The game subtract-a-square can also be played with multiple numbers. At each turn the player to make a move first selects one of the numbers, and then subtracts a square from it. Such a 'sum of normal games' can be analysed using the Sprague–Grundy theorem. This theorem states that each position in the game subtract-a-square may be mapped onto an equivalent nim heap size. Optimal play consists of moving to a collection of numbers such that the nim-sum of their equivalent nim heap sizes is zero, when this is possible. The equivalent nim heap size of a position may be calculated as the minimum excluded value of the equivalent sizes of the positions that can be reached by a single move. For subtract-a-square positions of values 0, 1, 2, ... the equivalent nim heap sizes are

0, 1, 0, 1, 2, 0, 1, 0, 1, 2, 0, 1, 0, 1, 2, 0, 1, 0, 1, 2, 0, 1, 0, 1, 2, 3, 2, 3, 4, … (sequence A014586 in the OEIS).

In particular, a position of subtract-a-square is cold if and only if its equivalent nim heap size is zero.

It is also possible to play variants of this game using other allowed moves than the square numbers. For instance, Golomb defined an analogous game based on the Moser–de Bruijn sequence, a sequence that grows at a similar asymptotic rate to the squares, for which it is possible to determine more easily the set of cold positions and to define an easily computed optimal move strategy.[3]

Additional goals may also be added for the players without changing the winning conditions. For example, the winner can be given a "score" based on how many moves it took to win (the goal being to obtain the lowest possible score) and the loser given the goal to force the winner to take as long as possible to reach victory. With this additional pair of goals and an assumption of optimal play by both players, the scores for starting positions 0, 1, 2, ... are

0, 1, 2, 3, 1, 2, 3, 4, 5, 1, 4, 3, 6, 7, 3, 4, 1, 8, 3, 5, 6, 3, 8, 5, 5, 1, 5, 3, 7, … (sequence A338027 in the OEIS).

Subtract-a-square can also be played as a misère game, in which the player to make the last subtraction loses. The recursive algorithm to determine 'hot' and 'cold' numbers for the misère game is the same as that for the normal game, except that for the misère game the number 1 is 'cold' whilst 2 is 'hot'. It follows that the cold numbers for the misère variant are the cold numbers for the normal game shifted by 1:

Misère play 'cold' numbers:
1, 3, 6, 8, 11, 13, 16, 18, 21, 23, 35, 40, 45, ...

• Nim
• Wythoff's game