The Prisoner's Dilemma

Imagine a prison consisting of 6464 cells arranged like the squares of an 8×88\times8 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.

Note by Marc Vince Casimiro
6 years, 6 months ago

No vote yet
1 vote

  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:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \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 6363 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 6363 moves, and hence there is no way he can complete the freedom-giving task. :(

Brian Charlesworth - 6 years, 6 months ago

Log in to reply

Poor prisoner :(

Jake Lai - 6 years, 6 months ago

Log in to reply

Haha. Yes, so sad. :(

Brian Charlesworth - 6 years, 6 months ago
×

Problem Loading...

Note Loading...

Set Loading...