Two people play a game with a bar of chocolate made of pieces, in a x rectangle. The first person breaks off a part of the chocolate bar along the grooves dividing the pieces, and eats the part he broke off. Then the second player breaks off a part of the remaining part and eats it. The game continues until one piece is left. The winner is the one who leaves the other with the single piece (i.e. is the last to move). Which person has a perfect winning strategy?
If you have figured this out,
Can you generalize this to a x bar situation? In what condition player 1 has a perfect winning strategy? And in what condition player 2 has a perfect winning strategy?
Challenge: What about a three dimensional bar of xx? And a bar of xx?
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
No extra limitations? I mean, can you push one middlemost chocolate and break all 4 sides? Or the separation lines may only be one straight line each time?