The second sequence of steps is one legal move shorter than the initial sequence,
and hence contradicts the assumption. Therefore, there is no shortest path between a
corner vertex and another vertex in which the second movement of the largest disk is
to a different peg.