3 ms·
His don't really look like mazes, though. There's never any choice involved in the lines. In a maze, you're constantly needing to decide if you should go left o
by onychomys 8y ago
His don't really look like mazes, though. There's never any choice involved in the lines. In a maze, you're constantly needing to decide if you should go left or right. His art is just one single line without any branches, as far as I can tell (...and as you'd expect from a TSP algorithm!).
- cr0sh 8y agoDid 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...
- deleted 8y ago[deleted]
- onychomys 8y agoThat post was edited after I responded to it.