Est. June 2021 Author: Tony Le
Given the size n, initial state, and search method, you can solve a sliding puzzle through the use of BFS, DFS, GBFS, and/or AStar.
Tole-Git/Sliding-Puzzle-Solver
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
Given the size n, initial state, and search method, you can solve a sliding puzzle through the use of BFS, DFS, GBFS, and/or AStar.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published