This project is coming from The Odin Project. The goal was to learn how data structures like graph is functioning, as well as using previous knowledge from other CS project of The Odin Project. The methods knight_moves take two arrays as argument in the form of [x, y]. One represent the start, the other the finish. It then calculate the shortest path for a Knight from a chessboard game to go to the finish cell from the start cell.
This project was really difficult and I was tired by the other project of CS, so I used AI to help myself. I didn't ask for a solution, I just wanted him to be my mentor by guiding me through the project. I understand how the final code work, so I submitted it to The Odin Project, and maybe I will try to do it by myself a little later.