Search⌘ K
AI Features

Solution: Poor Pigs

Understand how to calculate the minimum number of pigs required to find the poisonous bucket within given time constraints by analyzing rounds of testing and possible outcomes. This lesson guides you through using logarithmic computations to solve the problem efficiently.

Statement

You have buckets buckets of liquid, exactly one of which is poisonous. Your goal is to identify the poisonous bucket by feeding liquid to some number of pigs and observing whether they survive or die. You have a total of minutesToTest minutes to determine which bucket contains the poison.

The experiment proceeds in rounds according to the following rules:

  • Select any number ...