Knight Minimum Moves
Prereq: BFS on Graph
On an infinitely large chessboard, a knight is located on [0, 0].
A knight can move in eight directions.
Given a destination coordinate [x, y], determine the minimum number of moves from [0, 0] to [x, y].