Not quite the travelling salesman, but shortest route...
can be solved an an analog way.
Where you have a bunch of strings as the roads and knots as the intersections. (and some rubber bands to keep them in place above the map.
To find the shortest route between two points, just grab the points with your finger and tug apart, and the strings will show the shortest route.

While the computer has to work out all of the routes and then sort for shortest. An NP problem.

I believe we will find many more solutions to NP problems.

However, I also believe in chaos and in synchronicity as actual foundational elements of our universe (before space and time) and thus P ≠ NP.