TSP Traveling Salesman Problem.

Is one of the easiest puzzles that can be explained. Given X amounts of cities what is the most effective route that a salesman can take?

If you can solve it you will win a $1 million dollars. If you can prove that it cannot be solved you will get $1 million dollars. Sounds easy:

http://www.tsp.gatech.edu/problem/index.html

But alas this is no easy puzzle to solve. The puzzle becomes the mythological Leviathan of legend.

The beast that cannot be slayed. Why? It is easy to see why. If you have 4 cities your can figure out every route:

4!=24

4x3x2x1=24

Then the most effective route can be found. The problem is what happens if you have 10 cities?

10! = 3,628,800

The amount of time to check every solution gets out of hand where no computer could possibley do this. Unless you can solve the TSP which is shown to be NP complete. Then computers can find the right answer and has no need to check every answer.

Well after working neraly a year on this problem I have come up with an effective solution method for TSP.

Nearly 10 PHDS are stumped that I have given the solution to. Every day I'm working on getting more PHDS to prove me wrong. There going to have one hell of time doing so, for the proof is logic solid in my opinion. Here is the proof founded on 911 of 08.

TSP-Effective Solution Method

Example:

10! = 3,628,800

1 True 12345678910

_____________________

3,628,799 FalseWhat are the implications? Every person on this plant will be effected. Why think small ? It's one of the reasons I took on this problemWill the implications be postive or negative?

It will be one small step for man, one giant leap for mankind.

So by posting on here it can only further are cause to helping out humanity. If you have any questions or can be helpful in getting this proof proven wrong let me know.

Cordially

Ricky

## Bookmarks