Jump to content
BrainDen.com - Brain Teasers
  • 0
flamebirde

Poisoned Wine

Question

I heard this puzzle the other day; sorry if it's been posted before.

You are the chief sommelier for a massive kingdom. The king wants to throw a banquet tomorrow, and as a result he's asked you to bring out all one thousand bottles of wine you have in the cellar. So you walk into the cellar when suddenly one of your assistants comes running up to you: "Boss! Boss! This is terrible! Someone's gone and put poison in the wine!" After calming him down a bit, you manage to squeeze some useful information out of him:

 

There is exactly one bottle of poisoned wine.

The poison is completely undetectable and fatal in any quantity.

The poison takes exactly one night to work, so that the next morning anyone who drank the poisoned wine will be found dead.

 

You rush off and tell the king. Naturally, he's very displeased: "If you can't separate that poisoned bottle from the 999 good ones, your head's gonna be on the chopping block!"

You lament, "But how can I find just the one bottle by tomorrow morning without any resources?"

The king relents, and tells you that he has ten criminals who have been sentenced to death. You may use them as guinea pigs to test the bottles of wine. Each criminal can test an unlimited number of bottles.

How can you find the one poisoned bottle in one thousand with just ten testers? Think quickly, or perhaps the wine won't be the only thing running red tomorrow...

Share this post


Link to post
Share on other sites

3 answers to this question

Recommended Posts

  • 1

I think…

 

Spoiler

Each wine tester could take a small sip from a different half of the thousand bottles, in such a way that the poisoned bottle is uniquely specified by which of the ten testers are found dead the following morning.

 

For example, consider the bottles to be indexed from 0 to 999. This range would require ten binary digits (bits) to express. You could have Tester #1 sip from every bottle whose lowest bit is a "1", Tester #2 sip from every bottle whose second-lowest bit is a "1", and so on.

 

Edited by ThunderCloud

Share this post


Link to post
Share on other sites
  • 0

Let number bottles from 1 to 1000

10 firt bottle are drinked by each crimals

 

45 bottles next art drinked by 10C2 group of criminals

...

So on..

=> actually, 10 criminals can find 1 poison bottle in 1024 bottles

Share this post


Link to post
Share on other sites
  • 0

Yup, you both got it! I'm gonna mark Thundercloud as best answer since he was first by a couple of hours, but Aiemdao's answer is just as good and the one I had in mind (although I'm fairly sure both methods are identical).

Share this post


Link to post
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Answer this question...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

Loading...

  • Recently Browsing   0 members

    No registered users viewing this page.

×
×
  • Create New...