Algorithms, Dynamic Programming, Machine Learning, Artificial Intelligence, Markov Models.
the above analysis, we can see we should solve subproblems in the following order: Proceed time step t=0 up to t=T−1. At each time step, evaluate probabilities for candidate ending states in any order. Because each time step only depends on the previous time step, we should be able to keep around