For an assignment I've been asked to program a Java command line application that reads in from an ASCII file the structure of a maze, the program should then identify whether the maze is solvable hence have a beginning and an end. Example below:
###
# #
# #
## #
#
#####
The problem is that instead of using recursive calls in the implementation it must use stacks, I'm not asking for anyone to code this but I'm unsure as to how this can be achieved?
Any advice is appreciated, thanks.