So I’m doing this problem, and in the solution it says this:

Because of the constraints of the DP state, the beginning and ending squares are uniquely determined by their row.

But they… aren’t.

There are multiple ways to get from, say, row 4 to row 10 traversing only 7 squares. So why do they say this?