Finding Paths
In this 4x4 grid, if we choose two squares, for which pairs of squares can we find a path from one square to the other, moving only vertically or horizontally at each step, and visiting every square in the grid exactly once?
In this 4x4 grid, if we choose two squares, for which pairs of squares can we find a path from one square to the other, moving only vertically or horizontally at each step, and visiting every square in the grid exactly once?