Breadth-first search · shortest path
A search solving a maze
A perfect maze is carved, then breadth-first search floods outward from the start (teal) cell by cell until it reaches the exit (coral) — and traces the guaranteed shortest path back. The search restarts on a fresh maze each cycle.
Research pillar · Computational Intelligence & Optimization
This interactive is an illustrative stand-in — a simplified model built to convey the idea and behaviour behind this research area for teaching. It is not a specific published method, dataset, or result.
How it works
The maze is generated by a randomized depth-first carve, guaranteeing exactly one path between any two cells. Breadth-first search then expands the frontier evenly in all directions, recording each cell’s parent as it goes; because BFS explores in order of distance, the first time it reaches the exit it has found the shortest route, which is then reconstructed by walking the parent pointers back to the start.
More demos
These illustrate the research areas behind my work — see the research pillars for the full picture, or the crowd-evacuation simulation for a demo built directly from published papers.