I need help figuring out how to write a program with recursive functions in order to identify the path to a given maze. The maze is read in from a file and then when the path is found the maze is printed with the path shown.
The read in maze will look like this:
S- starting square
1-square you can go through
I understand that I have to use 2D arrays and check all the square until I get to the S square and then check for 1s but I am not sure how to continue finding the 1s to get the path of the maze. Please help!!