TheWrong
Way
Everyone knows where to go. Can you find the best way?
Trace the streets
Click intersections or drag along the roads from the green pin. Your line snaps to the real street network.
Reach the finish
Every road is a graph edge with a true length. Undo, clear or reset until you're happy, then submit.
See the best way
Dijkstra's algorithm reveals the mathematically shortest route. Every extra metre costs you points.
—
Statistics
Settings
Theme
Dark is the home turf. Light keeps the green and pink pins distinct.
Practice difficulty
Used when you start a practice map.
Junction hints
Ring the intersections you can move to next.
Building footprints
Tiny buildings and parks inside the blocks. Turn off for a cleaner map.
Reduce motion
Auto follows your system setting.
Sound effects
Short, quiet cues for drawing, undoing and submitting. Off until you turn it on.
Volume
Master volume for all sound effects.
Reset all data
Deletes every result, statistic and streak stored in this browser.
About
The idea
Two pins, one city, and a lot of tempting wrong turns. Draw the shortest route from A to B along the real streets. When you submit, the game runs Dijkstra's algorithm on the very same road graph and shows you the best way.
How to play
- Click a ringed intersection next to your line's end, or press and drag along the streets.
- Dragging back over the previous junction undoes a step. Roads can't be skipped and routes can't loop.
- Ctrl/Cmd + Z undoes. Clear and Reset never touch the map or the pins.
Scoring
efficiency = optimal ÷ yours × 100 and points = 1000 × (efficiency ÷ 100)². Any route as short as the optimal one scores a perfect 1,000. Distances are in fictional metres, derived from the street geometry.
Modes
The Daily Challenge is one deterministic city per local day, identical on refresh, saved in this browser only. Practice generates endless new maps and keeps its own statistics. Nothing syncs between devices.
Credits
Made by Xenfulz. One HTML file, no libraries, no network.