Creates a tree of all possible moves for a given starting location as a knight in chess. Then, uses a breadth-first searching algorithm, generalized for any chess piece, in order to find the minimal path between two points on the board.
View the live replit here: https://replit.com/@RimonMoomey/Knights-Tour#board.rb