1000 poisioned wine bottle and king’s celebration puzzle
You are the ruler of a medieval empire and you are about to have a celebration tomorrow. The celebration is the most important party you have ever hosted. You’ve got 1000 bottles of wine you were planning to open for the celebration, but you find out that one of them is poisoned.
The poison exhibits no symptoms until death. Death occurs within ten to twenty hours after consuming even the minutest amount of poison.
You have over a thousand slaves at your disposal and just under 24 hours to determine which single bottle is poisoned.
You have a handful of prisoners about to be executed, and it would mar your celebration to have anyone else killed.
What is the smallest number of prisoners you must have to drink from the bottles to be absolutely sure to find the poisoned bottle within 24 hours?
Number the bottles 1 to 1000, and write the number in binary format.
bottle 1 = 0000000001
bottle 250 = 0011111010
bottle 1000 = 1111101000
Now take your prisoner’s 1 through 10
Let prisoner 1 take a sip from every bottle that has a 1 in its least significant bit.
Let prisoner 10 take a sip from every bottle with a 1 in its most significant bit. etc.
Prisoner – 10 9 8 7 6 5 4 3 2 1
Bottle 924 – 1 1 1 0 0 1 1 1 0 0
In this, bottle #924 would be sipped by 10,9,8,5,4 and 3
That way if bottle #924 was the poisoned one, only those prisoners would die.
After four weeks,
line the prisoners up in their bit order and read each living prisoner as a 0 bit and each dead prisoner as a 1 bit.
The number that you get is the bottle of wine that was poisoned.
10 prisoners must sample the wine. Bonus points if you worked out a way to ensure than no more than 8 prisoners die.
Number all bottles using binary digits. Assign each prisoner to one of the binary flags. Prisoners must take a sip from each bottle where their binary flag is set.
Here is how you would find one poisoned bottle out of eight total bottles of wine.
Bottle | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
Prisoner A | X | X | X | X | X | X | X | X |
Prisoner B | X | X | X | X | X | X | X | X |
Prisoner C | X | X | X | X | X | X | X | X |
In the above example, if all prisoners die, bottle 8 is bad. If none die, bottle 1 is bad. If A & B dies, bottle 4 is bad.
With ten people there are 1024 unique combinations so you could test up to 1024 bottles of wine.
Each of the ten prisoners will take a small sip from about 500 bottles. Each sip should take no longer than 30 seconds and should be a very small amount. Small sips not only leave more wine for guests. Small sips also avoid death by alcohol poisoning. As long as each prisoner is administered about a millilitre from each bottle, they will only consume the equivalent of about one bottle of wine each.
Each prisoner will have at least a fifty percent chance of living. There is only one binary combination where all prisoners must sip from the wine. If there are ten prisoners then there are ten more combinations where all but one prisoner must sip from the wine. By avoiding these two types of combinations you can ensure no more than 8 prisoners die.
More puzzles to try-
- 3 + 3 = 3 5 + 4 = 4 1 + 0 = 3 2 + 3 = 4 ...Read More »
- Five puzzleFry ship’s pirates have obtained 100 gold coins and have to divide up the loot. The pirates are all ...Read More »
- There are 10 stacks of 10 coins each. Each coin weights 10 gms. However, one stack of coins is defective ...Read More »
- Dr.Willam wants to operate for three different persons who were wounded. But he had only two surgical gloves. There is ...Read More »
- Which clock works best? The one that loses a minute a day or the one that doesn’t work at all?Read More »
- In the gear arrangement, To which one will the needle touch, 1 OR 2Read More »
- A man leaves his house in the morning to go to office and kisses his wife. In the evening on ...Read More »
- Which letter replaces the question markRead More »
- A bridge will collapse in 17 minutes. 4 people want to cross it before it will collapse. It is a ...Read More »
- In a country where everyone wants a boy, each family continues having babies till they have a boy. After some ...Read More »
- A devotee goes to three temples, temple1, temple2 and temple3 one after the other. In front of each temple, there ...Read More »
- There is a perfectly accurate analog watch with hour, minute, and second hands. How many times a day do all three ...Read More »
- Four days are there which start with the letter ‘T‘. I can remember only two of them as “Tuesday , Thursday”. ...Read More »
- Two fathers took their sons to a fruit stall. Each man and son bought an apple, But when they returned ...Read More »
- A farmer is taking her eggs to the market in a cart, but she hits a pothole, which knocks over ...Read More »
- In the middle of the confounded desert, there is the lost city of “Ash”. To reach it, you will have ...Read More »
- Solve this logic sequence puzzle by the correct digit- 8080 = 6 1357 = 0 2022 = 1 1999 = ...Read More »
- Jasmine, Thibault, and Noah were having a night out and decided to order a pizza for $10. It turned out ...Read More »
- A murderer is condemned to death. He has to choose between three rooms. The first is full of raging fires, ...Read More »
- Some numbers are very mysterious. They are all integers. They have more than one digit. If you multiply them with ...Read More »