This project solves the classic 15-puzzle using A* and Breadth First algorithms, implemented in Python. It features a combined heuristic of Manhattan Distance, Linear Conflict, and Walking Distance for optimal performance and includes a user-friendly graphical interface to visualize the solution
Hello,
This combination makes it loop forever.
puzzle = Puzzle([[1, 2, 3, 7], [12, 8, 15, 4], [13, 10, 11, 5], [ 9, 6, 14, 0]])
There are other combinations as well.
Thanks,
Hello, This combination makes it loop forever. puzzle = Puzzle([[1, 2, 3, 7], [12, 8, 15, 4], [13, 10, 11, 5], [ 9, 6, 14, 0]]) There are other combinations as well. Thanks,