• HOME
  • NEWS
  • EXPLORE
    • CAREER
      • Companies
      • Jobs
    • EVENTS
    • iGEM
      • News
      • Team
    • PHOTOS
    • VIDEO
    • WIKI
  • BLOG
  • COMMUNITY
    • FACEBOOK
    • INSTAGRAM
    • TWITTER
Saturday, August 2, 2025
BIOENGINEER.ORG
No Result
View All Result
  • Login
  • HOME
  • NEWS
  • EXPLORE
    • CAREER
      • Companies
      • Jobs
        • Lecturer
        • PhD Studentship
        • Postdoc
        • Research Assistant
    • EVENTS
    • iGEM
      • News
      • Team
    • PHOTOS
    • VIDEO
    • WIKI
  • BLOG
  • COMMUNITY
    • FACEBOOK
    • INSTAGRAM
    • TWITTER
  • HOME
  • NEWS
  • EXPLORE
    • CAREER
      • Companies
      • Jobs
        • Lecturer
        • PhD Studentship
        • Postdoc
        • Research Assistant
    • EVENTS
    • iGEM
      • News
      • Team
    • PHOTOS
    • VIDEO
    • WIKI
  • BLOG
  • COMMUNITY
    • FACEBOOK
    • INSTAGRAM
    • TWITTER
No Result
View All Result
Bioengineer.org
No Result
View All Result
Home NEWS Science News

The ever-elusive riddle: What’s the best way to cut Christmas cookies?

Bioengineer by Bioengineer
December 7, 2020
in Science News
Reading Time: 4 mins read
0
Share on FacebookShare on TwitterShare on LinkedinShare on RedditShare on Telegram

IMAGE

Credit: Mikkel Abrahamsen

At some point in life, most people have stood over a rolled-out slab of cookie dough and pondered just how to best cut out cookies with as little waste as possible. Now, even math experts have given up on finding a computer algorithm to answer this type of geometric problem.

How can we maximize dough while cutting out Christmas cookies? How do we pack a suitcase or fill a kitchen cabinet while making the best use of space? One may have thought, “there must be a best way to do this.” Pondering such questions too deeply now appears to be a complete waste of time. The science is now here to support that it is impossible, for the time being, to figure out what works best for more than four or five spicy gingerbread men or Christmas tree cookies.

Assistant Professor Mikkel Abrahamsen of the Department of Computer Science 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 Mikkel 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.

Only four gingerbread cookies

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 growing, it will probably take millions of years before we are able to optimize the handling of a few additional objects.”

Furthermore, if one is working with more complicated shapes, like Christmas tree-shaped gingerbread, Mikkel Abrahamsen says that optimal solutions can only be found for up to four objects today.

An infinite number of options

What makes it so difficult? Abrahamsen explains that the problem is similar to solving equations of degree five or higher, and with many unknowns. Here, it is known that such a solution cannot always be written down using regular arithmetic operations.

“Our study proves that the problem has a nature that we in mathematics refer to as continuous — which in a nutshell, means that one must know all of the coordinates at which the cookies can be placed and all of the angles at which they can be rotated,” explains Abrahamsen.

As the possible combinations are infinite, there is no way to create a list of all the locations needed to try in order to find an optimal packing solution. Instead, algorithms that solve packing problems optimally need to be more analytical, which is time consuming. This contrasts with many other known algorithmic problems, where one can try a limited number of combinations before finding one that is optimal. Thus, packing problems are much more difficult.

So in practice, there are no better solutions to packing problems than the ones we humans can come up with.

“In both industry and over the kitchen counter we must continue to be satisfied with our less-than-optimal solutions and rest assured that we humans are still better than computers for these types of tasks — for the time being,” concludes Mikkel Abrahamsen.

###

FACTS:

  • In computer science and mathematics, packing problems are a class of optimization problems which involve attempting to pack a number of objects as closely as possible in either two or three dimensions. Mathematicians have been addressing packing problems for hundreds of years.
  • With the new result, the two-dimensional packing problem has graduated to a higher class of computational complexity, which is denoted ??. It was previously believed that the question belonged to the class NP together with the famed “travelling salesman problem”, which deals with calculating the shortest tour for visiting all cities on a given list.
  • The research was conducted by Mikkel Abrahamsen of the University of Copenhagen’s BARC Centre, at the Department of Computer Science; Tillmann Miltzow from Utrecht University in the Netherlands and Nadja Seiferth from Freie Universität Berlin in Germany. The research has received funding from the VILLUM Foundation, among others.
  • The study has been presented at the prestigious conference FOCS 2020 (IEEE Symposium on Foundations of Computer Science), running from 16-19 November. Read the article here.

Media Contact
Mikkel Abrahamsen
[email protected]

Original Source

https://arxiv.org/abs/2004.07558

Tags: Algorithms/ModelsCalculations/Problem-SolvingComputer ScienceMathematics/StatisticsSystems/Chaos/Pattern Formation/ComplexityTechnology/Engineering/Computer ScienceTheory/Design
Share12Tweet8Share2ShareShareShare2

Related Posts

blank

Serum Markers Predict Atrial Fibrillation in Diabetes

August 2, 2025
blank

Intrapleural Anti-VEGF Boosts Nab-Paclitaxel Efficacy

August 2, 2025

Amyloid Fibrils Connect CHCHD10, CHCHD2 to Neurodegeneration

August 2, 2025

Mapping the Human Hippocampus: Single-Nucleus to Spatial Transcriptomics

August 2, 2025
Please login to join discussion

POPULAR NEWS

  • Blind to the Burn

    Overlooked Dangers: Debunking Common Myths About Skin Cancer Risk in the U.S.

    60 shares
    Share 24 Tweet 15
  • Neuropsychiatric Risks Linked to COVID-19 Revealed

    45 shares
    Share 18 Tweet 11
  • Dr. Miriam Merad Honored with French Knighthood for Groundbreaking Contributions to Science and Medicine

    46 shares
    Share 18 Tweet 12
  • Study Reveals Beta-HPV Directly Causes Skin Cancer in Immunocompromised Individuals

    38 shares
    Share 15 Tweet 10

About

We bring you the latest biotechnology news from best research centers and universities around the world. Check our website.

Follow us

Recent News

Serum Markers Predict Atrial Fibrillation in Diabetes

Intrapleural Anti-VEGF Boosts Nab-Paclitaxel Efficacy

Amyloid Fibrils Connect CHCHD10, CHCHD2 to Neurodegeneration

  • Contact Us

Bioengineer.org © Copyright 2023 All Rights Reserved.

Welcome Back!

Login to your account below

Forgotten Password?

Retrieve your password

Please enter your username or email address to reset your password.

Log In
No Result
View All Result
  • Homepages
    • Home Page 1
    • Home Page 2
  • News
  • National
  • Business
  • Health
  • Lifestyle
  • Science

Bioengineer.org © Copyright 2023 All Rights Reserved.