C++ code for 8 puzzle problem which uses A* algorithm to find path from initial configuration to final configuration. Change initial and final configuration matrix in main function to check for different configurations. This also checks if we can reach the goal state from final state or not.
Abhi-13/8-puzzle
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|