A knight starts at (0, 0) on an infinite chessboard. Given target coordinates [x, y], return the minimum number of knight moves to reach the target.