Thanksgiving Tribute to my Brother

Happy Thanksgiving everyone! Since my brother and I are on different coasts, this year’s festivities will be the first time that we won’t have the chance to talk about math puzzles around the Thanksgiving table. In honor of his absence, I present this fiendishly difficult “hats” puzzle:
Trogdor the Burninator is at it again, except this time he has hit the mother lode and captured an infinite number of peasants. As always, the peasants can escape their doom if they can figure out what color hat (either red or blue) Trogdor has placed on their heads. All the peasants guess simultaneously (no post-hat-placement communication), all peasants can see all the other hats on their peers’ heads, and the peasants can discuss strategy beforehand (though Trogdor will listen in). If only a finite number of peasants guess incorrectly, all the peasants go free; if not, Burnination for all. Can you help the peasants?
I can’t. I have a decent solution for a countably infinite number of peasants, but apparently there is a math-y way to save an uncountably infinite number of peasants too!
Good luck to all, and I hope this puzzle helps keep you entertained this weekend :)

This entry was posted in Uncategorized. Bookmark the permalink.

2 Responses to Thanksgiving Tribute to my Brother

  1. CSTR says:

    I’m flattered that this puzzle is dedicated to me – but maybe a little confused about the setup of the problem. If Trogdor flipped a coin to decide each peasant’s hat color, each choice would be totally independent from the others. So no information could be gathered from looking at the other peasants’ hats except the fairness of the coin. Even if it was a really unfair coin so all the peasants guessed the likely result, every once in a while someone would be wrong – and this would happen to infinity and the peasants would all die. So sad.

  2. mindless says:

    I think your example breaks the “solution” I had, though as I mentioned the real answer is math-y and apparently deals with the Axiom of Choice. I’m counting on your course 18 know-how to solve this one.