This was an assignment for the Data Structures course designed to demonstrate the use of a stack.
The mazes start off as plain text files, the program reads the text file and loads the data into an array of pointers to pointers. The program then searches for a path to the end of the maze, adding the last place algorithm visited to the history stack. When the algorithm reaches a dead end, it goes back one step and looks for an alternate path, it repeats this process until it finds the maze exit. Once the solution has been found, the program outputs the solution to a text file.