Google Maps Fun » A Practical Approach to the Traveling Salesman Problems

Brute force will always provide the best solution to the problem, but unfortunately due to the exploding nature of the problem does not provide a quick solution once the number of points reaches double digits. You are limited to a maximum of 8 points when using this algorithm.

Nearest neighbor is a greedy algorithm that will provide a quick solution that gives a pretty good solution sometimes, but you also stand the risk of getting a pretty bad solution. It's really hit or miss here.