by: Dances with Code • 22
A graphical version of the classic "Traveling Salesman" mind-puzzle. The objective is to find the shortest route that connects a series of nine "cities" and returns to the starting point. Although there are 40,320 possible paths for each puzzle, most people can find the answer in only a few attempts. Try your luck!
Tags: travelling salesman , . traveling salesman , traveling salesman , travel salesman , shortest path shopping , shortest path salesman , salesman shortest path , salesman , travalling salesman