1. Junior Twelever Bronze
Join Date
Sep 2008
Posts
60

## Traveling Salesman Problem

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 False
What are the implications? Every person on this plant will be effected. Why think small ? It's one of the reasons I took on this problem Will 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

2. Junior Twelever Bronze
Join Date
Sep 2008
Posts
60
Wikipedia on TSP:

http://simple.wikipedia.org/wiki/Travelling_Salesman_Problem

TSP is NP. The math for P = NP? is staggering:

http://en.wikipedia.org/wiki/Complexity_classes_P_and_NP

Cordially

Ricky

P.S. TSP Effective Solution Method is - P=NP

3. The one million dollars isn't for finding a fast algorithm for the TSP problem, it's for proving that P=NP. Proving that P=NP doesn't have to do with the common version of the traveling salesman problem, as you stated, because it is NP-Hard and is an optimization problem. It would have to do with the decision problem of determining whether or not there was a route that would take less than some determinate cost. Although, I guess, finding an algorithm in polynomial time to solve it would also solve the decision problem.
Just wanted to point out one small mistake in your post.

Also, I don't understand what your "solution method" means, but I'm not surprised by that, given that you are Ricky.

4. Junior Twelever Bronze
Join Date
Sep 2008
Posts
60
Andersonwang thanks for the reply

The TSP Effective Solution Method I have shows not only a solution for TSP but P = NP.

The odds are against me for most people in the community think P= NP is False.

I have to scan a paper and post it up on 12 supporting my proof.

Don't worry Andersonwang the boys at Georgia Tech are still stumped.

You cannot deny that "logicial order"............ is the most effective method to solving any problem.

The best way to get this looked at is to have a solution for TSP and NOT to run around trying to get P = NP accepted by folks.

One small step at a time to the top of the mountain....................

Cordially

Ricky

5. I like your attitude.

-Rusty

6. Junior Twelever Bronze
Join Date
Sep 2008
Posts
60
Thanks Rusty

I realize life is going to knock us down but it's not about hitting back at other people or pushing back at life, since life does push at us, but rather getting up and moving forward always moving forward.

Cordially

Ricky

7. Your words remind me of a very inspirational speach in the movie Rocky Balboa. (Otherwise, a real turd of a movie, IMO).

Enjoy.

-Rusty

8. Junior Twelever Bronze
Join Date
Sep 2008
Posts
60
Yes thats where I heard that message awhile back and every day I thought about it. I did not quote the source since people would have thought it was cheesy.

No matter how far your in the dump and whatever age people can still change others and themselves.

The ESM Effective Solution Method for TSP is going to a battle, but I love math it never lies.

Cordially

Ricky

9. Junior Twelever Bronze
Join Date
Sep 2008
Posts
60
Strange but every time I hear this I get so much peace, so much direction. That everything is going to be alright.

Let me tell you something you already know. The world ain't all sunshine and rainbows. It is a very mean and nasty place and it will beat you to your knees and keep you there permanently if you let it. You, me, or nobody is gonna hit as hard as life. But it ain't 'bout how hard you hit; it's about how hard you can get hit, and keep moving forward. How much you can take, and keep moving forward. That's how winning is done. Now, if you know what you're worth, then go out and get what you're worth. But you gotta be willing to take the hit, and not pointing fingers saying you ain't where you are because of him, or her, or anybody. Cowards do that and that ain't you. You're better than that!" Rocky Balboa

10. Junior Twelever Bronze
Join Date
Sep 2008
Posts
60
TTT Things take time. Today we emailed more PHDS. Pretty soon they are going to start to talk to each other and then ideas will come forth and things will move forward.................another step to the mountain top.

Cordially

Ricky