Using Recursion
A maze is solved by trial and error -- choosing a direction, following a path, returning to a previous point if the wrong move is made
As such, it is another good candidate for a recursive solution
The base case is an invalid move or one which reaches the final destination