Recursionmedium
0:00.0
On a table, there are coins. Two players take turns removing either 1, 2, or 4 coins. The player who takes the last coin wins. Let if the first player has a winning strategy, and otherwise. Which of the following recursive rules determines ?
On a table, there are coins. Two players take turns removing either 1, 2, or 4 coins. The player who takes the last coin wins. Let if the first player has a winning strategy, and otherwise. Which of the following recursive rules determines ?