You are given two integers x and y representing a target coordinate on an infinite chessboard. A knight starts at coordinate $[0, 0]$ and can move in an L shape: $2$ squares in one direction and $1$ square perpendicular, for a total of $8$ possible moves from any position.

Return the minimum number of knight moves required to reach the coordinate $[x, y]$ from $[0, 0]$.

Constraints:

• $-300 \leq$ x, y $\leq 300$

• $0 \leq |$x$| + |$y$| \leq 300$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.