StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POFlood Fill Algorithm - Maze Navigation
text
Body
copied!<p>I am trying to implement a version of the flood fill algorithm to help solve the shortest distance path of a maze for a micro mouse. It works the same way as the regular flood fill except that each adjacent non-filled place will be assigned a number representing the distance of that place to the start place. Each time the algorithm moves to a different cell the number is incremented by one. Here is an example of a maze with no wall starting in the bottom left hand corner.</p> <pre><code>2 3 4 1 2 3 0 1 2 </code></pre> <p>Here is the current code I have ...</p> <pre><code>void nav_flood_rec(struct nav_array *array, int row, int column, int flood_num) { //Check the base case (not shown here) if (base_case) return; //Assign the flood number arrray->cells[row][column]->flood_number = flood_num; //North nav_flood_rec(array, row + 1, column, flood_num + 1); //East nav_flood_rec(array, row, column + 1, flood_num + 1); //South nav_flood_rec(array, row - 1, column, flood_num + 1); //West nav_flood_rec(array, row, column - 1, flood_num + 1); } </code></pre> <p>The problem that I am having is that the recursion is not going one step at a time (kind of vague but let me explain). Instead of checking all directions and then moving on the algorithm will keep moving north and not check the other directions. It seems that I want to make the other recursive calls somehow yield until the other directions are checked. Does anyone have any suggestions?</p>

Querying!

Guidance

An individual column

Larger individual text columns get their own page to allow for proper reading.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload