Stack Applications

Solving a Maze

Push the starting square onto the stack.
For the square on top of the stack,
- Attempt to move left.
- Attempt to move forward.
- Attempt to move right.
When a move is possible,
- Push the new square onto the stack.
When no move is possible (dead-end),
- Repeatedly pop squares off the stack until a move is possible.
When the final square is reached, the stack contains the path (in reverse order) from start to finish.

This page was last modified on Mar 28, 2001

URL: http://people.hsc.edu/faculty-staff/robbk/Coms262/Lectures/StackAppsMaze.html