Minimum knight moves
On a chess board (possibly infinite), return the fewest moves a knight needs to get from one square to another. Use BFS, and consider symmetry or bidirectional BFS to make it faster.
No answer yet. Write the first one; the best answer gets endorsed.