P vs NP Visualization
What if all routes
could race at once?
The Travelling Salesman Problem asks: what's the shortest path through N cities? Instead of checking one route at a time, this network fires a pulse through every path simultaneously. The optimal route glows brightest.
362,880
Possible Routes
10
Cities
<1ms
Solve Time
The strongest connections carry the most energy. When a pulse races through the network, the optimal tour — with connection strength 1.0 — glows 10x brighter than alternatives. The answer emerges as light.