-
Notifications
You must be signed in to change notification settings - Fork 0
This project uses the Breadth First Search (BFS) algorithm to find the minimum moves required to solve a sliding puzzle, exploring all possible states level by level to ensure the shortest path is found.
Selma-Bajramovic/zadatakSS
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This project uses the Breadth First Search (BFS) algorithm to find the minimum moves required to solve a sliding puzzle, exploring all possible states level by level to ensure the shortest path is found.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published