Topic summary · Student revision
Dynamic Programming Topic Review summary
Self-review on stagecoach-style DP: stages, states, and optimal substructure backwards/forwards.
Files: Topic-Review-Dynamic-Programming.pdf · Topic-Review-Dynamic-Programming-Answers.pdf · free public downloads · diagrams in the PDFs
Key learning points
- Define stages and states clearly before computing values.
- Bellman’s principle: optimal policy built from optimal sub-policies.
- Work backwards from the terminal stage (classic exam style) or forwards as taught.
- Record both the optimal value and the decision at each state.
- Trace the route from the initial state using stored decisions.
Worked example 1 — Principle
State Bellman’s principle briefly.
Working
Foundation of DP recursion.
Worked example 2 — Trace
After filling a table, how do you find the route?
Working
Values alone are not enough.
Worked example 3 — Practice point 1
Apply this idea from the Topic Review: Define stages and states clearly before computing values.
Working
Attempt without notes, then check the answers PDF.
Worked example 4 — Practice point 2
Apply this idea from the Topic Review: Bellman’s principle: optimal policy built from optimal sub-policies.
Working
Attempt without notes, then check the answers PDF.
Scaffolded Learning Sheet and answers (PDFs)
This page is a short, searchable overview for revision and search engines. Use the Scaffolded Learning Sheet first, then the Answers PDF for a full written solution. The printable PDFs remain the main classroom resource.