3 ms·
An actual fun problem: 100 prisoners are each assigned a black or white hat, at random. As always, they cannot communicate after the hats are assigned. Then th
by praptak 11y ago
An actual fun problem:
100 prisoners are each assigned a black or white hat, at random. As always, they cannot communicate after the hats are assigned. Then they are shown each other. None sees own hat, everyone sees everyone elses hat. Then they are led into separate rooms and each guesses their own hat color.
They win only if everybody guesses correctly. What strategy maximizes the probability of that event?
- philh 11y agoGurl pna trg svsgl creprag ol rirelbar thrffvat fhpu gung gur ahzore bs oynpx ungf vf rira (be bqq). I wouldn't be surprised if this is optimal, but I also wouldn't be surprised if it's not.
- discardorama 11y agoYikes. Rot13?? I haven't seen this since the days of UseNet, circa 1995! :-D