Knight Travails
0
1
2
3
4
5
6
7
0
1
2
3
4
5
6
7
Given a start and end position (row, column), find the shortest path that the Knight chess piece can take from start to end.
Random
Algorithm:
Breadth First Search
Log:
Click twice to select [start] and [end] squares