This question already has an answer here:
You are given an infinite chessboard, a knight, a source and a destination.(Normal chess rules apply) we are required to get move knight from source to destination in minimum moves possible.
I can only think of a bfs solution. Is there a better solution possible?
The question is further extended by adding obstacles to the board. How to solve this question what will be the complexity.(I basically need a answer for this.)