Route from A to H at the lowest total latency.

Tap a connected hop to extend the path; tap a hop already on it to backtrack. Fewest hops is a trap — edge latency is what you minimise.

Practice — no rating pressure. Get as close to the optimum as you can; each play teaches the pattern.

path: A

0ms

The Route — practice the decision, scored against the optimum

What does the The Route puzzle teach?

The shortest path minimises edge cost, not hop count — fewest stops is a trap.

Why do interviews ask about this?

Weighted shortest-path is the graph interview staple — Dijkstra vs greedy, and exactly when greedy fails.

How is it scored?

The engine computes the provably-optimal answer for the exact instance you played (dynamic programming, shortest-path, or exhaustive search — never a heuristic) and scores your attempt as a percentage of it. No login needed to see your score.