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]
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers6
Suggested Problems
-
2381 Solvers
-
Similar Triangles - find the height of the tree
479 Solvers
-
103 Solvers
-
Volume of a sphere given its surface area
156 Solvers
-
GJam: 2013 Rd1a Bullseye Painting
29 Solvers
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!