Computers Still Can't Solve This Cookie Cutter Dilemma

Computers Still Can't Solve This Cookie Cutter Dilemma

Today’s computers still aren’t ready for a common holiday question: How to cut out cookies with as little waste as possible.


Even math experts have given up on finding a computer algorithm to answer this type of geometric problem, which might also apply to packing a suitcase or filling a kitchen cabinet while making the best use of space.


Assistant professor Mikkel Abrahamsen of the University of Copenhagen’s computer science department and two research colleagues studied how difficult it is to figure out the optimal way to pack objects in two dimensions without overlap—a conundrum that computer scientists have plugged away at for decades.


“While algorithms let us solve seriously complex problems, this is one that remains too much of a mouthful for today’s computers. For now, it isn’t possible to pack more than 5-10 objects optimally. And, our result suggests that this number probably won’t increase much for the time being,” explains Abrahamsen.


Packing things optimally isn’t just an occasional problem at home, but in a variety of industries, including clothing manufacturing and metal processing. In each case, it is important to cut out materials with as little waste possible. In shipping, it applies to the packing of containers.


We know the size of the smallest square container in which we can pack up to 10 square 1×1 meter pallets. But by simply adding one additional pallet, it becomes impossible to calculate the optimal size of the container. Abrahamsen explains:


“As more pallets are added, the calculation time increases beyond exponentially. Not even the best computers can keep up. Theoretically it’s possible. But based upon the speed at which computing power is g ..

Support the originator by clicking the read the rest link below.