So far, every DP (dynamic programming) problem had a clear answer: the minimum cost, the maximum profit, the number of ways. You always knew exactly what would happen at each step.
But what if outcomes are random? A knight moves to one of 8 squares with equal chance. A ball drops left or right with 50% probability each. How do you compute the expected outcome? I'll show you how to handle randomness in DP. You'll learn to compute probabilities and expected values. By the end, you'll handle problems where transitions are probabilistic.