Nim
Several piles of tokens. Players alternate taking at least one token from a single pile. The player who takes the last token wins (standard rule; misère variants exist).
Example: piles of 3, 4, and 5. Does the first player have a winning strategy? What is the key idea?
See Wikipedia: Nim.