Developed a maze-solving script in Python, employing the breadth-first search (BFS) algorithm to determine the shortest path between two points within a maze. Implemented the project using the curses library for user interface and visualization.
-
Notifications
You must be signed in to change notification settings - Fork 0
Developed a maze-solving script in Python, employing the breadth-first search (BFS) algorithm to determine the shortest path between two points within a maze. Implemented the project using the curses library for user interface and visualization.
DularaWijerathne/Path_Finder
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
Developed a maze-solving script in Python, employing the breadth-first search (BFS) algorithm to determine the shortest path between two points within a maze. Implemented the project using the curses library for user interface and visualization.