25/01/2020
The Dictatorial Hat Part - 2
------------------------------------
The problem looks very abstract. What are the factors that make it abstract, fuzzy, and difficult ?
1. There are a 100 mathematicians in the queue. It is too big a number for any reasonable analysis.
2. The number of black / white hats are not known. Hence, there is nothing certain about the number of black / hats that the mathematicians can communicate, even secretly. their secret communication has to be about something else.
What could be one such property that can be communicated ?
It must be obvious that the mathematician putting his life at risk would be the last one in the queue. It is he who starts the process without any input whatsoever.
What are the different ways to deconstruct the problem ?
One obvious, simple way is to look at a smaller data size.
What happens when there are just 2 mathematicians ?
Assuming that the last in the queue sacrifices himself, what strategy will ensure that the front guy lives no matter what ?
Considering the attached diagram,
what should M2 call that M1 knows what is on the top of his head ?
Problem Statement
--------------------------
A dictator who hates science has rounded up all 100 mathematicians in his country. (All women, it turns out). The next day, he says, he will line them up so that each one can see everyone in front of her, but nobody behind. He will then put either a black or a white hat on each mathematician’s head, but nobody will know what colour hat she herself is wearing. Starting at the back of the line—the mathematician who can see 99 hats in front of her—he will ask each mathematician in turn what colour hat she is wearing. If she’s right, she lives. If she’s wrong, she’s instantly and painlessly decapitated.
Prospects don’t look good. But being mathematicians, the 100 confer and find a strategy that, at worst, leaves just one of them headless (and at best, saves them all). Who is the mathematician who might die, and what is the strategy?