Travelling Salesman's Problem

The goal of this problem is to find the shortest route for a set of cities. Each city must be visited once. The route must be a round trip. Click the 'New Game' button to start and then click on any city. After completing your round trip, click on the 'Solution' button to view the computer's route.

Author: Manu Konchady, e-mail: konchady@yahoo.com