There are 1000 bottles of wine and you know that there is exactly one of them that is poisonous, and will kill the drinker in 7 days. (To be precise, it will take randomly from 7 days to 7 days 23 hr 59 min 59 sec.) Now you have 10 testers who are willing to risk their lives and testdrink those wines. What is the smallest number of days you need to figure out which bottle contains the poisonous wine?
In addition, under this strategy, what is the maximum and minimum number of deaths?
The extension to this problem is, how will your strategy change if you only have 9 testers?
Just kidding, vertigo has a much better solution.

The first idea that popped into my head was:
Number the bottles 1100 and the testers 110
Have testers 110 drink bottles 110 respectively at 00:00 of day one. Then have them drink bottles 1120 at 00:00 on day two, then 2130 on day three, etc. When someone dies, the poisoned wine was the wine that person had seven days ago.
If the poisoned wine is in a bottle in the range 91100, it will take seven days to find out, so the minimum number of days with this method is 16 days: 10 days of drinking, and possibly 6 more days of waiting (At first I thought 7 days of waiting, but the last day of drinking is the first day of waiting). However, results could conceivably come as early as the seventh day.
With nine testers, the strategy becomes 19 drink 19 on day 1, 1018 on day two, 1927 on day three, ..., 8290 on day ten, and 9199 on day eleven.
If nobody is dead as of the eighth day after drinking is over, the 100th bottle is poisoned. So with nine testers, the minimum is 17 days: 11 days of drinking, and possibly 6 more days of waiting. Again, results could come as early as the seventh day.
Edited on February 26, 2005, 7:40 pm

Posted by Dustin
on 20050226 18:19:12 