100 prisoners problem
Mathematics problem
100 prisoners problem
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 after the first prisoner enters to look in the drawers. If all 100 prisoners manage to find their own numbers, they all survive, but if even one prisoner can't find their number, they all die. The straightforward approach of choosing drawers randomly is statistically hopeless, but there is an algorithm that offers the prisoners a realistic chance of survival. Anna Gál and Peter Bro Miltersen first proposed the problem in 2003.
Read on Wikipedia · Image Astrologyisnotscience.svg: Amada44 derivative work: Quartl, CC0
Open boosters, collect cards and trade them. Free to play.
Play for free