- This program will recursively find a path from a starting point 'S' to an end point 'G' of a maze specified in a text file.
- The solution is written to a text file.
Example:
Input File:
XXXXXXXXXXX XXSXXXXX XX XX XXXXX XX XX XXXXX XX XX XXXXX XX XX XX XX XXX XX XX XX XX X XXXXX XX X XXXXX XX XX XX XX XX XX XX XX XX XGXXXXXX XX XXXXXX XXXXXXXXXXX
Output file:
XXXXXXXXXXX XXSXXXXX XX XX.XXXXX XX XX.XXXXX XX XX.XXXXX XX XX.......XX XX XXX.XX XX ......XX XX .X XXXXX XX..X XXXXX XX.XX XX XX XX.XX XX XX XX.XGXXXXXX XX...XXXXXX XXXXXXXXXXX