There is a pile of 17 matchsticks. Players 1 and 2 take turns removing sticks, starting with Player 1. On each turn a player removes a number of sticks equal to the square of a positive integer, such that the number remaining is a non-negative integer. The player who cannot move loses. Which of the following is true?
Tap an option to check your answer.
Checking your account…
Game theory and strategic behaviour has come up 61 times in 6 exams since 2008.
This question is on Extensive-form games and backward induction, part of Game theory and strategic behaviour in Game Theory.
Games played in sequence, solved from the end back to the start.
TestStop has 16 past-paper questions on this subtopic.
Question from the DSE 2008 paper. Solutions are TestStop's own. Not affiliated with or endorsed by any examination authority.