stacks finding the exit from the starting position ( )we can examine our surroundings or more specifically the four neighboring cells and determine if we can move from this position we want to use systematic or well-ordered approach in finding the path thuswe always examine the neighboring cells in the same orderupdownleftand right in the sample mazewe find the cell above( )is open and prepare to move up one step before moving from the current positionhoweverwe need to lay down token to indicate the current cell is part of our path as indicated earlierwe place lowercase in the cell to indicate it comprises part of the path the complete set of steps taken to solve our sample maze are illustrated in figure after placing the tokenwe move to the open cell above the starting position the current position in the maze is marked in the illustration using an uppercase we repeat the process and find the cell above our current position is open token is laid in the current cell and we move up one position to cell ( from our vantage point above the matrixwe easily see the solution to the problemwhich requires that we move to the right but from the point of view of mouse searching for cheesethat specific move would be unknown using our systematic approachwe examine the cell above our current position we find it openand move up one position to cell ( from this positionwe figure the sequence of steps taken through sample maze is the starting position and is the exit the path is marked using the character while the current cell is marked with cells we visited but from which we had to backtrack are marked with