Image by Matt Collins

We can approach the solution to this problem in two stages - the obvious and the thinking man's version. Whether a prisoner would be able to fathom out the final solution within ten seconds is perhaps questionable.

**Assumption:** Since the King chooses which color crown to place on the heads of the prisoners by tossing a coin, there is a equal probability that any one of eight configurations can exist:

Prisoner 1 | Prisoner 2 | Prisoner 3 |
---|---|---|

**Solution 1:**

Without looking at the other prisoners, a prisoner can arbitrarily choose a color and have a 50% chance of being right. But of course that does not help, since the King's rules say that those who do not pass must be right. Thus the possibility of getting the right combination is 1 in 8. Choosing between red, blue or pass evenly, improves the odds to about 1 in 3, because the pass counts counts as true in most cases.

**Solution 2:**

But since each prisoner can see what is on the heads of the other two prisoners, and in six out of the eight possible cases, two prisoners will wear crowns of the same color. Thus we can develop a strategy that is correct in 75% of the time:

If the crowns that you can see are both the same color,

then choose the other color as your answer

else (the crowns are different colors) say "pass".

This produces the following table:

Prisoner 1 | Prisoner 2 | Prisoner 3 | Response 1 | Response 2 | Response 3 | Result |
---|---|---|---|---|---|---|

They die | ||||||

They live | ||||||

They live | ||||||

They live | ||||||

They live | ||||||

They live | ||||||

They live | ||||||

They die |

If all prisoners are required to register their answers simultaneously, then the last solution above is as good as can be expected. However, if the prisoners are allowed to respond in their own time, then the third one to answer can use the data from the other responses to improve __his__ odds to 100% -- that is provided that the others follow the above algorithm! The truth table for this case is as follows:

Prisoner 1 | Prisoner 2 | Prisoner 3 | Response 1 | Response 2 | Response 3 | Reasoning | Result |
---|---|---|---|---|---|---|---|

The others are seeing all blues, so you must be the same. | They die | ||||||

Others are both seeing one of each color, so yours must be the one other color to theirs. | They live | ||||||

Prisoner 1 is blue and is seeing one of each color; Prisoner 2 saw two blues, so you must be the other blue. | They live | ||||||

Prisoner 2 is seeing one of each color; Prisoner 1 is blue and is seeing two reds, so you must be the other red. | They live | ||||||

Prisoner 2 is seeing one of each color; Prisoner 1 is red and is seeing two blues so you must be blue. | They live | ||||||

Prisoner 1 is red and is seeing one of each color; Prisoner 2 is blue and is seeing two reds so you must be red. | They live | ||||||

The others are seeing one of each color, and you see both with the same color, so you must be the odd man out. | They live | ||||||

The others are seeing all reds, so you must be the same. | They die |

Interestingly enough, this additional information does not improve the final overall odds. Now could you work that out in 10 seconds?

There are solutions for more than three prisoners!

Last updated 2001/12/04

© J.A.N. Lee, 2001.