The first article that I used as a reference for Zeetah I’s solver was published in Byte Magazine back in 1987. Fortunately for me, this article was printed right around the time we were making Zeetah I. Stephen E. Belter, Computer-aided Routing of Printed Circuit Boards: an Examination of Lee’s Algorithm and Possible Enhancements, BYTE, June… Read More »
This part of the series on creating a diagonal micromouse maze solver presents the actual pseudo code that was used to implement a diagonal solver and it closely matches the C implementation. You will want to check out some of the data structures in the previous post (Diagonal Solver Data Structures).
This post provides more details on how the flooding is done.
If the maze has a region as shown on the left, and the mouse enters the region on the bottom left and exits on the right side, which path will your solver generate for the mouse?
Came across this visualization for a maze solver. http://qiao.github.com/PathFinding.js/visual/
Two major bugs turned up in the micromouse Decimus 2 since yesterday afternoon. Each was fatal. The maze solver bug was a surprise, the other was an example of the stupidity that I can manage when I put my mind to a problem…