Example of solving 8 puzzle using the following uninformed search algorithms:
- depth first
- breadth first
- iterative deepening
- bi-directional
- greedy
- a-star
ryanjustus/UninformedSearchDemo
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
Example of solving 8 puzzle using a the search techniques depth first, breadth first, iterative deepening, bi-directional, greedy, and a-star searches.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published