Two players take turns choosing one number at a time (without replacement) from the set $\mathcal{A}=\{-4, -3, -2, -1, 0, 1, 2, 3, 4\}$. The first player to obtain three numbers (out of three, four, or five) which sum to $0$ wins.
Does either player have a forced win?
Solution
No. The game is actually equivalent to tic tac toe. We know that in this game with correct play the game ends in draw. Hence neither player has a strategy for a forced win.
Does either player have a forced win?
Solution
No. The game is actually equivalent to tic tac toe. We know that in this game with correct play the game ends in draw. Hence neither player has a strategy for a forced win.
No comments:
Post a Comment