Extension question (provide a full explanation of your method (s):
Ann and Ben are playing a game with a pile of counters.
The rules are:
(a) at each turn a player may remove 1, 2 or 3 counters
excepting the number removed by the opponent on the
previous turn;
(b) the player who makes the last legal move wins;
Rule (b) automatically means that if there is one counter
left and the player can't move, then the opponent wins.
Can Ann win if she is presented with 4 counters?
Show that Ann can always win from a pile of 6 counters
regardless of Ben's previous move.
+5
Answers (1)
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “Extension question (provide a full explanation of your method (s): Ann and Ben are playing a game with a pile of counters. The rules are: ...” in 📗 Mathematics if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.