Traveling Salesman Problem (TSP) is a well known problem used to test artificial intelligence (AI) techniques and is the basis for sub-problems in many areas of applied science, such as DNA sequencing.
Below is a demonstration of the Traveling Salesman Game, which is a very simple interactive game that demonstrates a method that uses Evolutionary Computation (EC) to perform a time-optimal search which will discover the shortest distance between points. The example shown uses only a few points, but many can be given but it then gets tedious for the user, which is why computers are best for solving this sort of problem using advanced artificial intelligence methods such as EC. Copyright 2000-2011 Natural Selection, Inc. (R), www.natural-selection.com
Developer: Tim Hays