Given** Infinite chess board**, 2 coordinates are given (source, destination). Find the Minimum Moves for the **knight **to move from source to destination.

I have encountered this question twice and got rejected twice and I still don't know the solution.

When I told BFS is the solution, interviewer straight away says how much we take the visited matrix and queue since the board is infinite.

So BFS is not the solution,

Please tell the solution.