Exits from a Wythoff Position
Two piles contain 15 and 23 counters. Players alternate turns; a move removes any positive number of counters from one pile, or the same positive number from both piles. The player who removes the last counter wins. Assuming it is your turn at (15, 23), how many different moves lead to a position that is lost for the opponent (a second-player win)? Count moves, not resulting positions; two different moves never give the same position here. Answer with an integer.
Related problems & prerequisites
Worth solving first
- Wythoff's Losing Pairs up to Fifty 5.0/10
- Take Away a Perfect Square 5.0/10
Source: Wythoff's game (1907). Statement written for AxiomIQ.