In dynamic programming, a state space organizes the subproblems a recurrence must solve. In 0/1 knapsack, each state is a pair (i, c): the number of items considered and the remaining capacity. V(i, c) records the greatest value attainable from those items within that capacity. section 6.2.3
Knapsack states and resource limits
A state transitions to smaller subproblems: exclude item i and use V(i−1, c), or include it and use V(i−1, c−wᵢ). Base cases set V(0, c) and V(i, 0) to zero. With multiple resource constraints, each added dimension can greatly increase the number of subproblems. section 6.2.3 section 6.4.1



