Respected Prof Ruben Ruiz-Torrubiano
Your words............The Traveling Salesman Problem (TSP) is a classic example of a problem that is easy to state, easy to verify and hard to solve........are very correct! Using brute-force methods will take trillions of years. probably we can use some methods specified in Operations research, like simplex algorithm or artificial intelligence methods ....
So you are telling that multiverse are not possible??
You may please visit an alternative cosmological model as mentioned in my essay...
Best
=snp