ExamRizzTARA
Leave

TSA Original Paper 1 · Question 7 · Logic

Save

Anna and Ben are playing a strategic game with a pile of 18 tokens. They take turns removing tokens from the pile, with Anna going first. On each turn, a player must remove either 1, 2, or 3 tokens. The player who removes the last token wins the game. Both players play optimally, meaning they will always make the move that gives them the best chance of winning if such a move exists.

How many tokens should Anna remove on her first turn to guarantee that she wins the game?