Is it possible to solve the maze problem using Depth first search implemented using a stack.
I think it's impossible. because with the stack implementation you cannot backtrack.
If you use the recursive implementation of Depth first search you can backtrack.
Any idea's ?