100 prisoners problem

Each prisoner has to find their own number in one of 100 drawers, but may open only 50 of the drawers.

The 100 prisoners problem is a mathematical problem in probability theory and combinatorics. In this problem, 100 numbered prisoners must find their own numbers in one of 100 drawers in order to survive. The rules state that each prisoner may open only 50 drawers and cannot communicate with other prisoners. At first glance, the situation appears hopeless, but a clever strategy offers the prisoners a realistic chance of survival.

Anna Gál and Peter Bro Miltersen first proposed the problem in 2003.


© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search