The Stamps on Their Foreheads

  • Hard
  • Logical puzzles
  • Tests: Deducing from what others fail to deduce

The puzzle

Three logicians are shown seven stamps: four red and three green. Two are stuck on each of their foreheads and the last is hidden. Each sees the other two pairs but not their own.

Asked in turn whether they know their own colours, A says no, B says no, and then C says no. A, asked again, now says yes. What does A have?

Stuck?

One at a time, smallest first. Open only as many as you need — the whole point of the puzzle is the part you work out yourself.

Hint 1

A "no" is information. Work out what each speaker must have been seeing for their answer to be no.

Hint 2

If A saw two green on B and two green on C, A would know immediately - only three green exist.

Show the answer Hide the answer

A has one red and one green.

How to get there

List the arrangements first. With 4 red and 3 green and two stamps each, there are 13 possible distributions. A speaker knows their own pair exactly when what they can see leaves only one possibility for it.

A's "no" eliminates three. If A saw three green between B and C, A would know their own pair was red-red, since only three green exist - that covers (B=RG, C=GG) and (B=GG, C=RG). And if A saw red-red on both, only one green distribution fits, so A would know too. Ten arrangements survive.

B's "no" eliminates six more by the same test applied to what B sees, leaving four; C's "no" eliminates two, leaving two. In both survivors - (A=RG, B=RG, C=RR) and (A=RG, B=RG, C=RG) - A holds one of each colour, so A can now answer even though A still cannot tell what C has. Three people admitting ignorance carried every bit of the information.

The technique worth keeping

In these puzzles a "no" is data, not a dead end. For each answer, ask what the speaker would have had to see in order to say yes, and strike those cases off. The remaining case is the answer.