The coordinate of the horse's one-step route is (x. +2, y .+ 1) or (x.+1, y .+2).

Then just prove that the horse can reach the neighboring point through n steps.

Let the horse start with (0,0)

To achieve (1, 0), the steps are (0,0), (1, 2), (2,0), (0, 1).

. . .