Knight's Travails Implement BFS search to find shortest route for Knight to travel on a 8 * 8 chessboard Utilized a graph data structure for Node class