Diagonal Solver Introduction And Flooding

The Diagonal Solver needs to minimize the number of turns in the path.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?

(more…)

Continue ReadingDiagonal Solver Introduction And Flooding

Adachi micromouse maze solving algorithms

maze2 Going through some old notes, I came across reference to the micromouse maze solving methods described some time ago by Adachi in Japan. While these are apparently quite well known in Japan, they are, as far as I can tell, almost completely unknown in the West. At least, I can’t find any description of them in English anywhere on the web. After a lot of hard work with the Google translator and some assistance from Lem Fugitt, I think I have them pieced together…

(more…)

Continue ReadingAdachi micromouse maze solving algorithms