Search⌘ K
AI Features

Solution: Soup Servings

Explore the dynamic programming solution to the Soup Servings problem. Understand how to model the problem using memoization and probability calculations to determine when one soup empties before the other. This lesson guides you through normalization techniques and recursive state evaluation to compute precise probabilities efficiently.

Statement

You begin with two types of soup, A and B, each containing n milliliters. During each turn, exactly one of the following four operations is selected uniformly at random (each with probability 0.250.25), independent of all prior turns:

  • Serve 100100 mL of soup A and 00 mL of soup B.

  • Serve 7575 mL of soup A and 2525 mL of soup B.

  • Serve 5050 mL of soup A and 5050 mL of soup B.

  • Serve 2525 mL of soup A and 7575 mL of soup B.

The serving from both soups happens simultaneously in each turn. If an operation requires serving more than the remaining amount of a particular soup, simply serve whatever is left of that soup. The process terminates immediately after any turn in which at least one soup becomes empty.

Compute and return the probability that soup A becomes empty before soup B, plus half the probability that both soups become empty at the same time. Answers within 10510^{-5} of the true value will be accepted.

Note: There is no operation that serves 00 mL of soup A and 100100 mL of soup B. ...