Solving Knight Tour problem using BFS, DFS, A* algorithms and a nice animated JavaFX visualization - View it on GitHub