Search⌘ K
AI Features

Solution: Soup Servings

Explore how to solve the Soup Servings problem using top-down dynamic programming and memoization. Understand handling probability distributions of serving operations and effectively reduce state space for efficient computation. This lesson helps you apply DP techniques to optimize and solve complex recursive probability problems.

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