Probability and Expected Value Dynamic Programming: Markov Chains & Absorbing States

Expected value recurrences typically operate backward from terminal absorbing states toward the starting state. Let $E[u]$ denote the expected number of steps to reach the target from state $u$:

E[u] = 1 + \sum_{v} P(u \to v) \cdot E[v]