Hacker News Reader

> The difficulty with TSP is that you have to return to the start

That is not the difficulty with TSP. The problem doesn't get any easier if you can end wherever you please.

Yes, you're right. I misremembered the problem and thought a greedy algorithm would work in that case.

It still seems to me that bowl-stacking is solved by sorting alone, though, which is of course much simpler.

I tend to agree as to bowl-stacking.