breadth-first-search

A Micromouse maze-solving algorithm that uses BFS to determine each move.

For use with mackorone/mms, a Micromouse simulator.

Demo

The code is less than 300 lines and can fit on a single screen:

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
.gitignore		.gitignore
API.py		API.py
Direction.py		Direction.py
LICENSE		LICENSE
Main.py		Main.py
Maze.py		Maze.py
Mouse.py		Mouse.py
README.md		README.md
code.png		code.png
demo.gif		demo.gif