https://leetcode.com/problems/minimum-knight-moves/\n\nGiven an infinite chessboard, find minimum no. of steps for a knight to reach from the origin to (x, y).\n\nAccepted solution: Bidirectional BFS.\nThere\'s also [constant time solution](https://stackoverflow.com/questions/2339101/knights-shortest-path-on-chessboard/8778592#8778592).\n\n**Follow-up:**\nA list of forbidden coordinates are introduced where knight can\u2019t reach. Handle this in your code. Make sure the infinite loop is handled since the board is infinite.\n\nRelated problems:\n* https://leetcode.com/problems/escape-a-large-maze

https://leetcode.com/problems/minimum-knight-moves/\n\nGiven an infinite chessboard, find minimum no. of steps for a knight to reach from the origin to (x, y).\