Solution: Soup Servings
Explore how to solve the soup servings problem using dynamic programming by defining recursive states and applying memoization for optimizing probability calculations. Understand base cases and normalization techniques to handle large inputs effectively.
We'll cover the following...
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
Serve
mL of soup AandmL of soup B.Serve
mL of soup AandmL of soup B.Serve
mL of soup AandmL of soup B.Serve
mL of soup AandmL 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
Note: There is no operation that serves
mL of soup AandmL of soup B. ...