Groups
DP with probability models how chance flows between states over time by repeatedly redistributing mass according to transition probabilities.
Dynamic programming with expected value solves problems where each state transitions randomly and we seek the expected cost, time, or steps to reach a goal.