# Minimum steps to reach target by a Knight

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 minimum steps a Knight will take to reach the target position.

Examples:

```

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
```

## Recommended: Please solve it on “PRACTICE ” first, before moving on to the solution.

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)

```// C++ program to find minimum steps to reach to
// specific cell in minimum moves by Knight
#include <bits/stdc++.h>
using namespace std;

//	structure for storing a cell's data
struct cell
{
int x, y;
int dis;
cell() {}
cell(int x, int y, int dis) : x(x), y(y), dis(dis) {}
};

//	Utility method returns true if (x, y) lies inside Board
bool isInside(int x, int y, int N)
{
if (x >= 1 && x <= N && y >= 1 && y <= N)
return true;
return false;
}

//	Method returns minimum step to reach target position
int minStepToReachTarget(int knightPos[], int targetPos[],
int N)
{
//	x and y direction, where a knight can move
int dx[] = {-2, -1, 1, 2, -2, -1, 1, 2};
int dy[] = {-1, -2, -2, -1, 1, 2, 2, 1};

//	queue for storing states of knight in board
queue<cell> q;

//	push starting position of knight with 0 distance
q.push(cell(knightPos[0], knightPos[1], 0));

cell t;
int x, y;
bool visit[N + 1][N + 1];

//	make all cell unvisited
for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++)
visit[i][j] = false;

//	visit starting state
visit[knightPos[0]][knightPos[1]] = true;

//	loop untill we have one element in queue
while (!q.empty())
{
t = q.front();
q.pop();
visit[t.x][t.y] = true;

// if current cell is equal to target cell,
// return its distance
if (t.x == targetPos[0] && t.y == targetPos[1])
return t.dis;

//	loop for all reahable states
for (int i = 0; i < 8; i++)
{
x = t.x + dx[i];
y = t.y + dy[i];

// If rechable state is not yet visited and
// inside board, push that state into queue
if (isInside(x, y, N) && !visit[x][y])
q.push(cell(x, y, t.dis + 1));

}
}
}

// Driver code to test above methods
int main()
{
//	size of square board
int N = 6;
int knightPos[] = {4, 5};
int targetPos[] = {1, 1};

cout << minStepToReachTarget(knightPos, targetPos, N);

return 0;
}
```

Output:

```3
```

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 contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

# GATE CS Corner    Company Wise Coding Practice

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.
3.9 Average Difficulty : 3.9/5.0
Based on 18 vote(s)