Comment by stoneman24
11 days ago
Yep, I have a more optimised model of stacking than my wife’s ideas. This has lead to “discussions” (still at a friendly level) and the dish washer being placed in my list of responsibilities.
I think optimal configuration is very much a NP complete problem.
Just because a problem is NP-complete doesn't mean it's infeasible to produce "good enough" approximate solutions. The traveling salesman problem is a great example of this.
Not only that, the maximum n a dishwasher can hold is small enough that it can be fairly trivially solved within a reasonable amount of time...though to be fair, iterations are pretty slow, but I think that's fairly easily compensated for with axioms (silverware goes in the silverware spot)
Apologies, my OCD was showing.
It’s an interesting problem to pack the dishwasher with as many objects as possible and maintain the highest level of cleanliness. Sometimes, there’s an small thing leftover so then repack in a different configuration.