The puzzle solver will find the shortest way to solve the 15 square puzzle with the least amount of moves using A* search. To generate a puzzle use GenGemPuzzle with the argument being the complexity of the puzzle, higher numbers scramble the puzzle more. To solve the puzzle, provide the puzzle as a console input into the puzzle program which will then provide the solution and the steps to get to the solution.
-
Notifications
You must be signed in to change notification settings - Fork 0
jcabrera2502/15-Puzzle-Solver
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published