Recursion can help us navigate a maze, keeping track for us of the last node visited, backing out to unexplored possibilities.
This video starts with an overview of the problem seen so far and continues on to show how we can solve the problems of looping between two squares, stopping once we find the destination, and displaying the solution path in order.
This was designed for use along with CS102/107 at UIC.
Loading more stuff…
Hmm…it looks like things are taking a while to load. Try again?