A chess knight stands at [0, 0] on an infinite board whose squares have integer coordinates. In one move it jumps to one of 8 squares: two steps in one direction and one in the other, for example [2, 1] or [-1, 2].
Return the fewest moves needed to reach [x, y]. The target can have negative coordinates, and its absolute values are at most 300.
- The board is symmetric, so reaching
[x, y] takes as many moves as reaching [|x|, |y|] - You cannot search an infinite board. You must keep the search inside a finite window, and that window has to be large enough to be correct