4 ms·
Is the algorithm different from a simple sorted order in this case? The difficulty with TSP is that you have to return to the start, which wouldn't seek to be t
by Conlectus 5y ago
Is the algorithm different from a simple sorted order in this case? The difficulty with TSP is that you have to return to the start, which wouldn't seek to be the case with stacled bowls, unless you're stacking them in a ring somehow.
- thaumasiotes 5y ago> 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.
- Conlectus 5y agoYes, 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.
- thaumasiotes 5y agoI tend to agree as to bowl-stacking.