# Labyrinth — ideas for next

- [ ] Animate the solver too: show BFS and A* frontier expanding cell by cell, so the two counts are visible as they grow
- [ ] Run both solvers on the same maze side by side and show the counts as a bar comparison
- [ ] Add more solvers: Dijkstra, greedy best-first, and a wall-follower, all counted the same way
- [ ] Weighted terrain (mud, ice) so BFS and A* actually disagree about the best route
- [ ] Export the maze as PNG and as a text/ASCII map, plus a seed box so a maze can be reproduced exactly