This question is about Is it NP-hard to fill up bins with minimum moves? It is one of the "greatest" open questions. It has so many upvotes and views, I hardly believed nobody ever put a comment, so I assume they were deleted to keep the purity of the question. But comments can also be used to clarify things. The question mentions that even a specific restricted version of the problem is "not obvious", but I think I've found a greedy algorithm for that case so I was wondering if that's worth discussing. (I would have to really think it through before posting it, but this current meta-question is valid regardless).
This is my first meta-question and I didn't find a search method for a meta-search for this question. Also I didn't try putting a comment / partial answer to have it removed and then complain on meta.