Quoted By:
Since the heimin's puzzle is proving to be a hard one, let me present you an easier one for those of you wanting to take a brake, a palate cleanser of sorts:
"Given a list of cities and the distances between each pair of cities, write an algorithm that finds in polynomial time the shortest possible route that visits each city exactly once and returns to the origin city."
Sounds simple enough, price is US$1,000,000. Good luck!
