A traveling salesman wishes to make a number of sales calls in different
cities. Naturally he wants to spend as little time actually traveling as
possible (he is not paid for travel time).

He sets up the various cities he wants to visit and looks up the travel time
from each one to every other one. He writes a simple computer program to figure
out all of the possible routes and compare the total travel time in each route,
in order to find the fastest possible route. (The problem could also be worked
for minimum distance).

The program is written for any arbitrary number of cities. But the salesman
discovers that the program appears not to work for more than a certain number
of cities. Explain what the limit is and how it can be overcome.

73 de Jim, N2EY