Given a starting and destination cell, find the the shortest path through the empty squares. This is written using the "Sample Algorithm" from the Pathfinding Wikipedia page.
Run Sketch Again Run Maze 1 Run Maze 2 Run Maze 3