Search⌘ K
AI Features

Solution: Soup Servings

Explore the dynamic programming method to solve the Soup Servings problem by modeling the serving process recursively. Learn to calculate the probability that soup A empties before soup B by normalizing inputs and using memoization to optimize computations within constrained states.

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 ...