Diagonal Solver Pseudo Code

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). (more…)

Continue ReadingDiagonal Solver Pseudo Code

Diagonal Solver Flooding

FwdFloodThis post provides more details on how the flooding is done.

 

 

 

(more…)

Continue ReadingDiagonal Solver Flooding

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