Did you miss this part of the post you're responding to (I am modifying it to make it hopefully clearer)? > The two problems are clearly dual > A: since a maz

Did you miss this part of the post you're responding to (I am modifying it to make it hopefully clearer)? > The two problems are clearly dual > A: since a maze's solution is a non-intersecting path, and > B: conversely every non-intersecting path is the solution to a corresponding maze Focus on "B" - the output of a TSP algorithm "is the solution to a corresponding maze". IOW, the negative space of the TSP algorithms output is the maze itself...