Imagine a prison consisting of cells arranged like the squares of an chessboard. There are doors between all adjoining cells. A prisoner in one of the corner cells is told that he will be released, provided he can get into the diagonally opposite corner cell after passing through every other cell exactly once. Can the prisoner obtain his freedom?
This is not an original problem.
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
Imagine the cell floors painted like on a chess board, and suppose the starting cell floor is black. Then the cell floor of the opposite corner cell will be black as well.
Now every move by the prisoner results in a change in floor color. Further, each odd-numbered move leaves the prisoner in a white-floored cell. So after any path of 63 moves he will always be in a white-floored cell, which means he can never end up in the (black-floored) opposite corner cell after 63 moves, and hence there is no way he can complete the freedom-giving task. :(
Log in to reply
Poor prisoner :(
Log in to reply
Haha. Yes, so sad. :(