dynamic-programming-analysislisted
Install: claude install-skill Ronnasayd/aipp
# Dynamic Programming Analysis
Breaks any complex problem into DP-style sub-problems: **optimal substructure** (solution depends on smaller solutions) + **overlapping sub-problems** (recurring parts, solve once, reuse). Applies to business, personal decisions, architecture, research, learning, projects.
## Protocol
| # | Step | Action | Gate |
| --- | ------------------- | ----------------------------------------------------------------------------------- | ----------------------------------------------------- |
| 1 | Define main problem | Restate precisely, final state, explicit/implicit constraints | — |
| 2 | Decompose | Break into smaller parts; recurse until **base cases** (directly solvable) | tree structure, see `references/response-template.md` |
| 3 | Identify overlaps | Which sub-problems recur across branches? Which partial solutions reuse? | mark explicitly — biggest efficiency win |
| 4 | Resolution order | Base cases first, then by dependency (prereq before dependent) | execution sequence |
| 5 | Solve each | Smallest → largest; compare options if multiple; note which parent problem it feeds | —