![]() |
![]() |
![]() |
Traveling Salesman (v. 1.0)
Dances with Code опубликовал приложение 2011-02-17
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! |
Бесплатно
![]() ![]() ![]() ![]() ![]() |
![]() |
|
![]() |