There are n! paths in a graph of size n. I can find the optimal TSP solution in O(n^2 2^n) time. Therefore, it is possible to do better than examine every path to find a TSP solution.
And today's xkcd comic.
I just wish I had a modicum of artistic ability, I swear I've got about five ideas for good xkcd style comics.