Problem-Solving Strategies · Challenge problem

Three piles hold $3$, $5$ and $7$ counters. Players alternately take any number of counters from ONE pile; whoever takes the last counter wins. How many different winning first moves are there?