Nova projects a maze on the floor. Rocket hurries through it. "I found a way out!" he says.
Raven counts his steps. "That works," she says. "Is there a shorter path?"
Nova says, "Interesting. Try a different route and count again." Rocket starts back at the beginning. Let's help them find a path, then a shorter one.
There is more than one way through a maze. Find a path from S to E. Then try to find a SHORTER path. Compare with a partner.
Find a path from S to E. Click cells in order to draw it. Walls block movement; you can't go diagonally.
For each problem, circle the BEST algorithm.
(There's no one right answer; defend your choice with a partner.)
A path through a maze is an algorithm: a list of moves in order.
The shortest path uses the fewest moves. Count the moves to compare.
| Statement | True or false? |
|---|---|
| A maze can have more than one path. | ? |
| The shortest path always has the most turns. | ? |
| Comparing two paths is comparing two algorithms. | ? |
| A wall means you must find another way. | ? |