IEEE, University at Buffalo | Fall 2026

Maze robot exploration

A replay of the Python maze solver. Step through the run to see what the robot senses and how its map changes.

Triangle = robot and heading · G = goal · thick line = wall · dashed line = unknown passage · shaded cell = visited

The robot has perfect wall readings and moves one cell at a time. It treats unseen passages as open when planning, then checks before moving. The actual maze is shown for comparison; the robot cannot read it. Motor drift is tested in the separate corridor simulation.