Ripple

A small change. A surprising consequence.

Can you change its mind?

The spark takes the cheapest route. Make it visit the diamond ◇.

1 / 2 · Make a route tempting

Tap a marked cell to make it easier or harder. Watch the spark choose again.

Upper route —

Diamond route ◇ —

● spark · ◎ finish · ◇ visit here · each small dot costs 1 energy

Waking the spark…

2 changes left

Look inside the algorithm

It adds up the energy along each route and chooses the smallest total. You change the conditions; it chooses the path.

Dijkstra tries the lowest energy total first.

○ waiting to be checked · ✓ checked · → chosen path · × closed

Level seed · 7F93A2