This project solves the 8 puzzle problem with A star algorithm. Algorithm uses Manhattan Distance and Wrong Tile as the heuristics. Code consists of other uninformed search functions such as Depth First Search, Limited Depth Search, Iterative Deepening. But those functions are commented in the main function and not being used for this project.
-
Notifications
You must be signed in to change notification settings - Fork 0
himanshuj24/8_puzzle_problem
About
This code solves the 8 puzzle problem with A star algorithm.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published