Two algorithms to solve N_puzzle problem.
- Python3
- BFS (Breadth-first search)
- Can find an optimal solution, but time-consuming.
- A* algorithm
- An efficient heuristic algorithm.
- Cost function：
steps_from_start + manhattan_distance_to_goal
-
Notifications
You must be signed in to change notification settings - Fork 0
BFS & A* algorithm to solve N_puzzle problem
License
ispobock/N_puzzle
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
BFS & A* algorithm to solve N_puzzle problem
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published