As the number of dimensions or tracked variables grows, the possible states can multiply until storing or iterating over them becomes impractical. Dynamic programming faces this when it must process every state. section 4.5 section 2.2
Resource allocation
A budget of 12 across four projects produces 1,053 states. Increasing the budget to 100 and the projects to 10 produces nearly six million states, making enumeration far more demanding. section 4.5
Tracking every previously visited state can also make predicting what comes next computationally overwhelming. The Markov property offers a shortcut by avoiding dependence on the full history. section 2.2
Figure 2.2 Conditional probability of dependency of next state to all previous states.
Illustrates how a next-state prediction can depend on all previously visited states. section 2.2









