Comment Re:Eulerian Path (Score 1) 514
it's certainly a space-filling curve problem, but it's not the traveling salesman problem. you aren't just trying to avoid revisiting nodes -- you're trying to maximize the *angle* between edges when you visit the node, to avoid overlap while you're turning the mower. which is at least an interesting wrinkle in the problem.