Two Piles, Two Kinds of Move
The puzzle
Two piles of counters. A move is to take any number from one pile, OR the same number from both. Whoever takes the last counter wins.
Which positions lose for the player about to move? Start by finding the small ones.
Stuck?
One at a time, smallest first. Open only as many as you need — the whole point of the puzzle is the part you work out yourself.
Hint 1
Work upwards. (0,0) loses. (1,2) loses - check every move from it.
Hint 2
The losing pairs begin (0,0), (1,2), (3,5), (4,7), (6,10). Look at the differences and at the ratios.
Show the answer Hide the answer
The losing positions are the pairs (⌊nφ⌋, ⌊nφ²⌋), where φ = 1.618… is the golden ratio: (0,0), (1,2), (3,5), (4,7), (6,10), (8,13) and so on.
How to get there
Build the list upwards. A position loses if every move from it reaches a winning position. (0,0) loses trivially. (1,2) loses: taking from either pile or from both always leaves something the opponent can finish.
Continuing gives (3,5), (4,7), (6,10), (8,13). The differences are 0, 1, 2, 3, 4, 5 - one more each time - and the smaller numbers 0, 1, 3, 4, 6, 8 are exactly the whole numbers not appearing as a larger member.
Those smaller entries are ⌊nφ⌋ for n = 0, 1, 2, … with φ = (1 + √5)/2 = 1.618, and the larger are ⌊nφ²⌋ = ⌊nφ⌋ + n. Every whole number appears exactly once across the two sequences - a Beatty pair - which is why no position is missed. The golden ratio appears because it is the only number whose sequence and its shift-by-n partner partition the integers this way.
The technique worth keeping
Compute the losing positions from the bottom up: a position loses when every move leads to a winner. Then look for structure in the list - the pattern is the strategy, and it is often more interesting than the game.