February 24, 2014 § 2 Comments
For those of you who are unaware, I have been in Budapest for a little over a month, and I have been quite a bit busier than I expected. I know I have been much worse than I had intended about keeping up with this blog, but I heard a great puzzle the other day, and it is quite exciting. Here it is:
There are infinitely many logicians (one for each integer), and an adversary tells the logicians that he will place a hat on each of their heads. He tells each logician that each hat will either be red or blue. He then tells each logician that, once he has placed a hat on each of their heads, the logicians may see the color of all the hats that are not their own, and then they must attempt to guess their own hat color. The logicians win if only a finite number of them guess incorrectly. Is there a strategy that will allow the logicians to win if the adversary knows their strategy?
Just to make sure the problem is clear, each logician gets a different hat. At no point do they get to see their own hat color nor do they receive any information from any of the other logicians once they have received their hat. All they can see is the color of the hat placed on each other logician’s head.
Thanks for reading!
-A Student of Logic