<< Previous Puzzle Thursday, April 14, 2011 Newer Puzzle >>

Travelling Salesman Problem

A salesman needs to visit towns as efficiently as possible. In computer science this is known as travelling salesman problem (TSP). Trace Perfect puzzles of this type are like the TSP, with just one difference. In classic TSP, you are supposed to end where you started from. This is not the case in the Trace Perfect puzzles.
See Also: http://en.wikipedia.org/wiki/Travelling_salesman_problem

link to this puzzle

No comments:

Post a Comment