Here's a small puzzle with an ingenious solution:
Consider the set of numbers {-4, -3, -2, -1, 0, 1, 2, 3, 4}. Two players alternately choose one number at a time from the set (without replacement).
The first player who obtains any three out of his or her selected numbers (this may happen after (s)he has chosen 3, 4 or even 5 numbers) that sum to zero wins the game.
Now, the question is that, does either player have a forced win? That is to say, can either player always choose in a way such that a win is guaranteed?
note:
this problem is not original. I found the game on this blog .
http://recreational-math.blogspot.in
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Your game is analogous to Tic Tac Toe. So no, there is no forced win.