Quote from jaan:
the THP caused a huge splash in the math community, being a seemingly simple puzzle yet challenging the very foundations of modern information theory.
You aren't kidding. It has potential huge implications for hamming codes, information compression, etc.
For those who don't know the puzzle, here it is: (Try to really think it over before searching the net for a solution).
THE THREE HAT PROBLEM:
Three men enter a room and are each given a colored hat that is based on a coin-flip. The two hat colors are red and blue. While inside the room, they are not allowed to communicate in ANY way. The only communication that is allowed is a (big hint here) strategy to use before entering the room.
The rules are simple. In order to win, one person must correctly pick the color of his hat and no one is allowed to guess incorrectly. When it is your turn to guess the color of your hat, you may pass.
If two people pass and the third randomly guesses hit hat color, there is a 50% chance the team of three men will win.
Can you come up with a strategy they can use that will give a greater chance of winning?
