Devise a method to maximally survive the Prisoners Dilemna.
The Prisoners Dilemna is the Warden will free all 100 prisoners if they can all find their own number, 1-100, with 50 guesses from a cabinet with drawers labeled 1-100. The drawers are filled randomly with 100 cards labeled 1-100. The prisoners can not give any info to one another after entering the cabinet room but they may decide on a method before the first prisoner tries.
To succeed your algorithm must succeed >250 times out of 1000 tries. This appears impossible as the random chance of surviving per prisoner set is 1/2^100.
next_drawer = PD(prisoner, prisoner_guess_history) where
prisoner_guess_history is [prisoner_guess_history; drawer number_in_drawer]
Solve

Solution Stats

12 Solutions

6 Solvers

Last Solution submitted on Jul 25, 2026

Last 200 Solutions

Solution Comments

Show comments

Problem Recent Solvers6

Tim Chris Cleveland George Berken Ahmad

Suggested Problems

More from this Author306

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!