Given a square chessboard of N x N size, the position of Knight and position of a target is given. We need to find out the minimum steps a Knight will take to reach the target position.
In above diagram Knight takes 3 step to reach from (4, 5) to (1, 1) (4, 5) -> (5, 3) -> (3, 2) -> (1, 1) as shown in diagram
This problem can be seen as shortest path in unweighted graph. Therefore we use BFS to solve this problem. We try all 8 possible positions where a Knight can reach from its position. If reachable position is not already visited and is inside the board, we push this state into queue with distance 1 more than its parent state. Finally we return distance of target position, when it gets pop out from queue.
Below code implements BFS for searching through cells, where each cell contains its coordinate and distance from starting node. In worst case, below code visits all cells of board, making worst-case time complexity as O(N^2)
- Time complexity: O(N^2).
At worst case, all the cells will be visited so time complexity is O(N^2).
- Auxiliary Space: O(N^2).
The nodes are stored in queue. So the space Complexity is O(N^2).
This article is contributed by Utkarsh Trivedi. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Minimum steps to reach target by a Knight | Set 2
- Count of all possible ways to reach a target by a Knight
- Puzzle | Can a Knight reach bottom from top by visiting all squares
- Minimum steps to reach any of the boundary edges of a matrix | Set-2
- Minimum steps to reach any of the boundary edges of a matrix | Set 1
- Minimum steps required to reach the end of a matrix | Set 2
- Print all possible shortest chains to reach a target word
- Word Ladder (Length of shortest chain to reach a target word)
- Minimum steps to reach end of array under constraints
- Minimum steps to reach end from start by performing multiplication and mod operations with array elements
- Minimum steps to reach a destination
- Minimize the number of steps required to reach the end of the array | Set 2
- The Knight's tour problem | Backtracking-1
- Probability of Knight to remain in the chessboard
- Warnsdorff's algorithm for Knight’s tour problem
- Possible moves of knight
- Number of blocks in a chessboard a knight can move to in exactly k moves
- Minimum number of jumps to reach end | Set 2 (O(n) solution)
- Burn the binary tree starting from the target node
- Minimum number of jumps to reach end