I heard a neat one recently.
There are N people in a dungeon. The dungeon master has a a bunch of colored hats, with an arbitrary distribution among N distinct colors (they could all be blue, there could be one of each, etc.). He tells them that he's going to distribute the hats to everyone, and at least one person has to guess his or her hat correctly or else everyone dies. He allows them to meet and discuss some sort of algorithm to figure out how to do this in advance. After he distributes the hats, they aren't allowed to communicate, signal, etc. in any way. All they can do is see the color of everyone else's hat.
So what strategy should they take? You can suppose that everyone has a really good memory.
There are N people in a dungeon. The dungeon master has a a bunch of colored hats, with an arbitrary distribution among N distinct colors (they could all be blue, there could be one of each, etc.). He tells them that he's going to distribute the hats to everyone, and at least one person has to guess his or her hat correctly or else everyone dies. He allows them to meet and discuss some sort of algorithm to figure out how to do this in advance. After he distributes the hats, they aren't allowed to communicate, signal, etc. in any way. All they can do is see the color of everyone else's hat.
So what strategy should they take? You can suppose that everyone has a really good memory.
Comment