Shortest Path for Knight to reach a Target.
Implemented the Breadth-First Algorithm (BFS) to find out the least possible moves in which a knight can reach to a target position.
- Fock and Clone the repo
- Run the knightsolution.java file
- Enter the initial and target positions
- Get the minimum no. of steps and path in the form of matrix