This project explores the Uniform Cost Search Algorithm and A-Star Search algorithm with Misplaced Tile Heuristic and Manhattan Distance Heuristic.
-
Notifications
You must be signed in to change notification settings - Fork 0
pratheekcr/8_Puzzle_Solver_Using_A-Star_Search_Algorithm
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Project to solve a given eight puzzle of any varying difficulty level. Search algorithms are used to reach the goal node from the initial node.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published