Qm

Three prisoners, three boxes, two looks each

Three prisoners are numbered 1, 2 and 3. Three boxes, also numbered 1, 2 and 3, each contain one slip bearing a prisoner's number, arranged in a random order. Each prisoner in turn enters alone, may open two of the three boxes, and must leave everything as found. All three go free only if every prisoner finds their own number.

The strategy: each prisoner first opens the box bearing their own number, then opens the box bearing whatever number they found inside.

  1. What is the probability that all three succeed with this strategy?
  2. What is the probability if each prisoner instead opens two boxes at random?
Show a hint

Write down the six possible arrangements of the slips. For each one, follow the chain for each prisoner and see whether it reaches their number within two boxes.

Your answer

Solving needs a free account

Answers, streaks and solutions unlock when you are signed in. Reading the question and the hint stays free.

Discussion

Sign in to join the discussion · reading is open to everyone

💡 Discussion rules

  1. No full solutions here. Hints and approaches only.
  2. Complexity, edge cases and intuition are the point.
  3. Interview experiences are welcome. Respect your NDAs.

Loading discussion…

Learn the concepts

The theory behind this question.

Related questions

One helper who may swap two slipsTwo prisoners, two boxes, one look eachThe warden knows the chain strategy100 prisoners and 100 boxesHow many prisoners find their number on average?
All questions →