Backtracking and recursion to solve a maze

Question

I am tasked with solving a maze using the method of backtracking and recursion. This is more of a conceptual question about this concept.

How is the backtracking call ever reached? From all the examples I have seen it looks as though recursion is always called immediately before the backtracking step, so that backtracking can not be reached. Can anyone explain to me how the backtracking step is reached?

Chris Okasaki · Accepted Answer · 2014-03-31 15:39:31Z

1

Backtracking happens when the recursion returns. For example, if you are at location A, and there are two neighboring locations, B and C. You could make a recursive call on B. When it has finished exploring that part of the maze, it will return (ie, backtrack) to the call at location A, which will then make a new recursive call on location C.

answered Mar 31, 2014 at 15:39

Chris Okasaki

4,9851 gold badge22 silver badges20 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Backtracking and recursion to solve a maze

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related