4 ms·
Every prisoner assigns every box a random name from the list. Boxes cannot be modified in any way, so every prisoner has to do it on their own. The (unexplained
by gambiting 10y ago
Every prisoner assigns every box a random name from the list. Boxes cannot be modified in any way, so every prisoner has to do it on their own. The (unexplained) assumption here is that each prisoner can do that somehow, either in their head or on a piece of paper. It doesn't matter that every prisoner has their own unique assignment of names to boxes.
The crucial part here is that it's not guaranteed to work - but it gives prisoners 30% chance to survive, as opposed to some infinitesimally small number if each picks 50 boxes on random.
- captaincanoe 10y agoIf each prisoner randomly labels the boxes in their own (presumably independent) manner, then this strategy fails miserably. In fact, it's equivalent to each prisoner choosing 50 random (unique) boxes. The solution specifies that "the prisoners must first agree on a random labeling of the boxes by their own names." This is necessary.
- hexane360 10y agoIf each prisoner has their own ordering, it's exceedingly likely that one of those orderings will have a 51-cycle. This strategy only works with one common dictionary. You have the same individual odds, but you've linked each person: each member of a cycle succeeds or fails together. If it wasn't decided beforehand, you could just make up the ordering as you go. This gives exactly the same odds as random selection.