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