This is a variant of ujjagrawal's excellent puzzle

Suppose that like ujjagrawal's puzzle, an assassin infiltrates a king's cellar and poisons 1 of the king's 500 wine bottles. Upon being detected and cornered, the assassin takes a suicide pill and dies.

Anyone who consumes even the most minute amount of the poisoned wine will die between 12 and 24 hours. Consumers of the poisoned wine exhibit no other symptom besides death, and the poison can not be detected by any other means.

The emperor decides to use some prisoners to taste the wine in order to determine the poisoned bottle. There is one catch, however. It is known that the assassin has precisely one accomplice among the prisoners. The accomplice has access to the same poison that the deceased assassin used to envenom one of the king's bottle. If the accomplice is chosen as one of the tasters, he will surreptitiously consume the poison regardless of which bottle he is given to drink in the hope of corrupting the deduction process.

The emperor does not know which of his prisoners is the assassin's accomplice. The emperor is intrigued by this logical puzzle, and he figures that he can simply use some extra prisoners to compensate for this unknown unreliable taster. What is the minimum number of prisoners (and the tasting procedure) that he would need to use in order to correctly find the poisoned bottle among the 500 bottles within 24 hours?

## Question

## bushindo 14

This is a variant of ujjagrawal's excellent puzzle

Suppose that like ujjagrawal's puzzle, an assassin infiltrates a king's cellar and poisons 1 of the king's 500 wine bottles. Upon being detected and cornered, the assassin takes a suicide pill and dies.

Anyone who consumes even the most minute amount of the poisoned wine will die between 12 and 24 hours. Consumers of the poisoned wine exhibit no other symptom besides death, and the poison can not be detected by any other means.

The emperor decides to use some prisoners to taste the wine in order to determine the poisoned bottle. There is one catch, however. It is known that the assassin has precisely one accomplice among the prisoners. The accomplice has access to the same poison that the deceased assassin used to envenom one of the king's bottle. If the accomplice is chosen as one of the tasters, he will surreptitiously consume the poison regardless of which bottle he is given to drink in the hope of corrupting the deduction process.

The emperor does not know which of his prisoners is the assassin's accomplice. The emperor is intrigued by this logical puzzle, and he figures that he can simply use some extra prisoners to compensate for this unknown unreliable taster. What is the minimum number of prisoners (and the tasting procedure) that he would need to use in order to correctly find the poisoned bottle among the 500 bottles within 24 hours?

## Link to post

## Share on other sites

## 14 answers to this question

## Recommended Posts

## Join the conversation

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