Postby Lunch Meat » Tue Feb 11, 2014 8:37 pm UTC
I've been thinking about this puzzle and think I've come up with a different way of explaining the solution--at least I don't remember seeing it before. Most of the solutions I've seen start from the bottom--proving that one blue-eyed person will leave on Day 1, therefore two blue-eyed people will leave on Day 2, therefore three on 3, etc.
I started thinking about it from the top down, like so:
It's intuitively clear that if the number of blue-eyed people indicated by the guru, X, is equal to the number of blue-eyed people on the island, Y, then they will all leave on Day 1.
Suppose there are 100 blue-eyed people and the guru says she can see 100 blue-eyed people, they will all leave that night.
Suppose there are 99 blue-eyed people and the guru says she can see 99 blue-eyed people, they will all leave that night.
And so on and so on all the way down.
It's also pretty intuitive that if X=Y-1, all X people will leave on Day 2.
Suppose there are 100 blue-eyed people and the guru says she can see 99 blue-eyed people, they will all leave the next night.
Suppose there are 99 blue-eyed people and the guru says she can see 98 blue-eyed people, they will all leave the next night.
Suppose there are 98 blue-eyed people and the guru says she can see 97 blue-eyed people, they will all leave the next night.
And so on and so on.
It's where X=Y-2 that things start becoming not intuitively clear. If there are 100 blue-eyed people and the guru says she can see 98 blue-eyed people, it's not immediately obvious what information is added. As the common objection goes, everyone already knew there were 98 blue-eyed people. But a random blue-eyed person (A) will not know they're in a situation where Y=100; they will suppose that Y=99. And therefore they will assume all the blue-eyed people will leave on Day 2, and when that doesn't happen they will know that Y=100. Therefore we can determine that if X=Y-2, all X people will leave on Day 3.
So what if X=97 and Y=100? A will suppose that Y=99 and therefore all blue-eyed people will leave on Day 3. This is because A1, the random blue-eyed person in the supposed Y=99 situation, will be supposing A is not-blue-eyed (A1, existing in A's imagination, cannot have any information that A doesn't have), that Y=98 and therefore all blue-eyed people will leave on Day 2. A knows that no one will leave on Day 2, but A1 does not know that because A1 does not know their own eye color. A needs to wait for A1 to determine that Y isn't 98 before A can use A1's lack of action to determine that Y isn't 99. When no one leaves on Day 3, A will know that Y=100 and all will leave on Day 4.
When X=96, A will suppose that Y=99, A1 will suppose that Y=98, and A2 will suppose that Y=97 (A2 cannot have any information about A or A1). A2 will expect all blue-eyed people to leave on Day 2, and A1 will expect them to leave on Day 3. A knows that no one will leave on Day 2 or 3, but needs to wait for A2 to determine that Y isn't 97, so that A1 can determine Y isn't 98. When no one leaves on Day 4, A will know that Y=100 and all will leave on Day 5.
This isn't actually a new explanation, just another way of looking at nested hypotheticals. We know that when Y=100, A will assume Y=99. A knows that if Y=99, A1 will assume Y=98. A1 knows that if Y=98, A2 will assume Y=97. A2 knows that if Y=97, A3 will assume Y=96. Yes, A already knows that Y isn't 98, 97, or 96, and that if X=95, no one will be leaving on Days 2, 3, or 4. A1 knows that Y isn't 97 or 96 and no one will be leaving on Days 2 or 3. A2 knows that Y isn't 96 and no one will be leaving on Day 2. But A has to wait for A1 to decide whether to leave on Day 5, which means A has to wait for A2 to decide whether to leave on Day 4, which means A has to wait for A3 to decide whether to leave on Day 3. Any solution that skips one of these steps will boil down to something contradicting our rule that if X=Y, all blue-eyed people will leave on Day 1.