https://github.com/kyle-mccarthy/maze-traversal

Traverse a maze using DFS or BFS to find the shortest path from start to finish.
https://github.com/kyle-mccarthy/maze-traversal

Last synced: about 1 month ago
JSON representation

Traverse a maze using DFS or BFS to find the shortest path from start to finish.

• Host: GitHub
• URL: https://github.com/kyle-mccarthy/maze-traversal
• Owner: kyle-mccarthy
• Created: 2014-12-16T22:23:50.000Z (about 10 years ago)
• Default Branch: master
• Last Pushed: 2014-12-17T16:37:15.000Z (about 10 years ago)
• Last Synced: 2024-11-06T06:04:28.542Z (3 months ago)
• Language: Python
• Size: 117 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README

Awesome Lists containing this project

README

        
USES: Python 2.7

TO RUN: python main.py

Enter file name when prompted

Will build shortest path using an algorithm similar to DFS

Alternatively, you could uncomment line 17 in main.py and comment

18 and 19 and it will find the shortest path using BFS. (I realize

that the robot jumps around, so it can't be used for this project,

but I didn't want to delete it.)