Upload your graph

To Academics and Curious People

If you landed here out of curiosity, or because you guessed that we had solved the TSP in polynomial time, know that your guess is correct. The founder of Tesperyon figured out an extremely fast algorithm that solves the Traveling Salesman Problem in polynomial time using heuristics and proprietary methods—without AI, simply through that.

The shortest path, which would take thousands of years to solve by brute force today, can now be found in a matter of seconds or minutes, depending on the size of the desired path. How long did it take to create the code? About 10 years, from the refinement of the original idea to the compilation of the code in the Rust programming language 🦀

We know this sounds crazy and astonishing, which is why the service is available here in two versions: a commercial version for those who want solutions to real-world logistics problems, and an academic version for those who simply want to test the code.

To preserve server efficiency, we have limited the dimension up to 200 points