CPSC 231: Extra Practice Exercises For Recursion (Intermediate)

Code writing (there won't be code writing questions on the final exam this term but it would help increase your understanding to write your own code)

• Using recursion your program should find a path from a starting location in the maze (2D list of characters) to the exit.

  • Hint: to avoid endless recursion try marking paths that you have previously attempted.

• If needed here is a [starting program].

  • Starting location (1,1)

  • Location of exit (9,8)

  • 'S' = starting location

  • 'W' = walls (cannot enter, not part of valid path to exit)

  • Space = tunnel (can enter)

• Solution [Link to the solution]:

  • The above legend applies along with an additional character: '+' marks locations that have been previously attempted.