Path Dash — find the cheapest route

Your cost 0

Legs 0

Time 0:00

Backtracks 0

Record 0 wins · 0 losses

Route log

How to play

Every edge costs its printed weight; the numbers under your nodes are the running total.
Click a neighbouring node to add it to your route. Dashed nodes are the ones you can step to.
Click the previous node or press Backtrack to undo a step. Backtracking is free.
Nodes can't be revisited — with positive weights, no shortest route ever needs a loop.
Reach the goal to finish. Score is 1000 × shortest ÷ your total, so an optimal route scores 1000 and every wasted point costs you.
Matching the shortest total is a win; finishing over it, or revealing the route, is a loss. The tally is cumulative and stays in this browser.
Gold edges after a round are Dijkstra's shortest route; cyan edges are the route you walked.
Hints cost 75 points. Reveal route ends the round without a score.
Realistic weights grow with drawn edge length, so geometry is a clue. Wild weights ignore geometry — stop eyeballing and start reasoning.