Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?
But a formal mathematical 'proof' - which could enable an exact computation, has not yet been found.
Note: Small-scale versions of the problem, where there is enough time to check every possible route, will, of course reveal the most efficient route.
Ideas for new topics, and suggested additions / corrections for old ones, are always welcome.
If you have skills or interests in a particular field, and have suggestions for Wikenigma, get in touch !
Or, if you'd like to become a regular contributor . . . request a login password. Registered users can edit the entire content of the site, and also create new pages.
( The 'Notes for contributors' section in the main menu has further information and guidelines etc.)