The Riddle That Seems Impossible Even If You Know The Answer

100 prisoners numbered 1-100 must find their own numbers in randomly arranged boxes. Each prisoner can open up to 50 of the 100 boxes and must restore the room exactly as found without communication.

All 100 prisoners must find their numbers to be freed; if even one fails, all are executed.

Without strategy, each prisoner has a 50% chance of finding their number. The probability that all 100 succeed randomly is 1/2^100, which is astronomically small—about the same odds as two people picking the same grain of sand from all beaches and deserts on Earth.

Prisoners can only coordinate strategy before entering the room; they cannot communicate during the challenge.

• Open the box with your own number on it • Read the number inside and open that box • Continue following the chain of numbers until you find your own slip • Stop when you locate your number or after 50 boxes

All boxes form closed loops in any arrangement. When you start with your numbered box, you are guaranteed to be on the loop containing your slip. The only question is whether that loop is short enough to find your number within 50 openings.

• A loop of length 1: box contains its own number • A loop of length 2: two boxes point to each other • Maximum loop length: 100 boxes in one continuous loop • Success depends on your number being in a loop of 50 or fewer

This simple strategy gives over a 30% chance that all prisoners will find their number—an improvement of nearly 30 orders of magnitude over random selection.

The slip with your number and the box with your number form a unit. Any prisoner who sees your slip will go to your box, so there cannot be dead ends in the system.

• Every slip is hidden inside a box • Every box contains exactly one slip • This creates a complete permutation with only loops and no dead ends

When you start with box 73 and find slip 73, you will be directed back to box 73, closing the loop. This closure is the only way the system terminates.

You are mathematically guaranteed to find your slip because the system must form loops, and starting with your numbered box places you on the loop containing your slip.

The total number of ways to arrange 100 slips in 100 boxes is 100 factorial. Since loops can be written in 100 different ways while representing the same loop, the number of unique loops of length 100 is 100 factorial divided by 100.

• Probability of a loop of length 100: 1/100 (1%) • Probability of a loop of length 99: 1/99 • Probability of a loop of length 98: 1/98 • General pattern: probability of length n is 1/n

Probability of failure is: 1/51 + 1/52 + 1/53 + ... + 1/100. This sum equals approximately 0.69, giving a 69% chance that at least one loop exceeds length 50.

Probability of success is 1 - 0.69 = 0.31, or approximately 31%. All prisoners succeed together or the majority fails together.

Each prisoner still has exactly a 50% chance of finding their individual number because they can only open 50 of 100 boxes.

• With random searching, outcomes are independent and outcomes distribute around 50 prisoners succeeding • With the loop strategy, outcomes are highly correlated: either all prisoners succeed or fewer than 50 find their numbers • No middle ground exists where most but not all prisoners find their numbers

In 1000 repeated experiments: 31% of runs see all 100 prisoners succeed, 69% of runs see fewer than 50 succeed on average.

The strategy works by linking everyone's outcomes together through the loop structure. All prisoners in the same loop share the same fate.

• 1,000 prisoners each checking 500 boxes: 30.74% success rate • 1 million prisoners each checking 500,000 boxes: 30.685% success rate • 1 billion prisoners: only slightly higher than 1 million

As the number of prisoners approaches infinity, the success probability approaches a specific limit derived from calculus: 1 minus the natural logarithm of 2, which equals approximately 30.7%.

The probability of failure can be calculated as the integral of 1/x from n to 2n, which equals the natural logarithm of 2 (ln(2)).

No matter how many prisoners you have, the loop strategy guarantees at least a 30% chance of all prisoners escaping. You will always end up with above 30% success using this approach.

A guard who supports the prisoners can guarantee success by swapping the contents of just two boxes. This breaks any loop longer than 50 into two separate shorter loops.

A guard who knows about the loop strategy and tries to create loops longer than 50 can be countered by prisoners arbitrarily renumbering the boxes—adding five to each box number or any other systematic change.

Renumbering boxes is mathematically equivalent to redistributing the slips. This restores the problem to a random arrangement of loops, returning prisoners to their 31% chance of survival.

Even against a malicious adversary, prisoners are not doomed. They retain strategic options to maintain their probability of success.

The problem initially seems essentially impossible: 100 prisoners each with a 50% random chance gives odds comparable to picking the same grain of sand from Earth's beaches.

Yet with the loop strategy, whether you have 100, 1 million, or any number of prisoners, you always maintain at least a 30% success rate. This seems counterintuitive and wrong.

The strategy's power comes from linking everyone's outcomes together instead of each prisoner acting independently. This interdependence is the key to the dramatic improvement.

The loop strategy creates a binary outcome: you cannot get close to winning with only a few people missing their numbers. You either fail hard or succeed completely, which is fundamentally different from random selection.