Three engines over the same two texts: a textbook dynamic program that fills the whole grid, Myers' 1986 greedy search that walks it by edit distance, and Myers' linear-space version that throws the path away and finds it again. They must all return the same number. The third view draws the grid they are searching.