I think to solve this one is awarded with a million $. But there is proof it can be done. It's equivalent to show that P = NP, and this is not known to be correct, actually it's assumed it is not
We denote by messenger problem (since in practice this question should be solved by each postman, anyway also by many travelers) the task to find, for finitely many points whose pairwise distances are known, the shortest route connecting the points. Of course, this problem is solvable by finitely many trials. Rules which would push the number of trials below the number of permutations of the given points, are not known. The rule that one first should go from the starting point to the closest point, then to the point closest to this, etc., in general does not yield the shortest route
A plane full of Canadians crashes and explodes on the exact border between Mexico and the USA. In which country should the survivors be buried?
Canada, where they are from.