Given a knight on a chess board at position [0, 0]
[0, 0]
Write a function that will calculate the smallest amount of moves for the knight to get to position [x, y]
[x, y]