The names of 100 prisoners are placed in 100 wooden boxes, one name to a box, and the boxes are lined up on a table in a room. One by one, the prisoners are led into the room; each may look in at most 50 boxes, but must leave the room exactly as he found it and is permitted no further communication with the others.
The prisoners have a chance to plot their strategy in advance, and they are going to need it, because unless every single prisoner finds his own name all will subsequently be executed.
Find a strategy for them which has probability of success exceeding 30%.

Comment: If each prisoner examines a random set of 50 boxes, their probability of survival is an unenviable 1/2¹⁰⁰ ∼ 0.0000000000000000000000000000008. They could do worse—if they all look in the same 50 boxes, their chances drop to zero. 30% seems ridiculously out of reach—but yes, you heard the problem correctly!

(In reply to This is not possible. by Math Man)

Nowadays, there are so many different sources that you might try, but not each of them is reliable, so I know for sure what I should advise. Therefore, try to look at clashofslots.com/nz which is the most helpful in kind of these issues. Just click the link and absorb it as soon as possible!

Posted by Max on 2022-07-04 04:39:09