A Short History

A Short History of Packing Problems

Have you ever tried to fit every suitcase into the trunk of a car, or squeeze one more book onto a full shelf? That little puzzle — how do you fit things together without wasting space? — has a surprisingly grand history. People have been asking it for centuries, and some of the smartest mathematicians who ever lived spent years trying to answer it.

The Grocer's Question

Walk past a fruit stand and you will often see oranges stacked in a neat pyramid. Each new layer nestles into the dips of the layer below. It looks obvious, but here is a real question: is that the tightest way to stack round things, or could a clever arrangement squeeze in even more?

Back in 1611, the astronomer Johannes Kepler — the same man who figured out how planets orbit the Sun — guessed that the grocer's pyramid is the best you can do. It seemed easy to believe and impossibly hard to prove. The guess became known as the Kepler conjecture, and it stayed unsolved for almost four hundred years. It was not until 1998 that the mathematician Thomas Hales finally proved Kepler was right, using a mountain of computer calculations.

Circles, Bubbles, and Busy Bees

Long before Kepler, the ancient Greek mathematician Apollonius studied how circles can be nestled snugly inside one another. If you keep filling every gap with the biggest circle that fits, you get a beautiful, lacy pattern called an Apollonian gasket — a packing that goes on forever, getting tinier and tinier.

Nature is a packing expert too. Honeybees build their honeycomb out of six-sided cells, never squares or circles. Why hexagons? Because hexagons tile together with no gaps and use the least wax for the most honey. For a long time this was just a hunch, called the honeycomb conjecture — and it was finally proved true in 1999. The bees knew the answer all along.

Packing Becomes a Game

Here is the fun part: packing puzzles are everywhere in games. When you twist and drop falling blocks in Tetris, you are packing shapes into rows. When you arrange the seven pieces of a tangram to make a cat or a sailboat, that is packing. Pentominoes — the twelve shapes you can make from five squares — fit into a rectangle in exactly 2,339 different ways, and people have made whole puzzle books out of finding them.

Newer games keep the idea alive. In the Watermelon Game (a viral hit from a few years ago), you drop fruit into a jar, and matching fruit merge into bigger fruit — packing, gravity, and merging all at once. The mechanic is centuries of mathematics hiding inside something you play on your phone.

Tiles That Never Repeat

Most floor tiles repeat in a simple pattern: shift them over and they line up again. But mathematicians wondered — could you cover a floor with tiles that never repeat, no matter how far you look? In the 1970s, the physicist Roger Penrose found a way to do it using just two shapes and a sprinkle of the golden ratio, a special number that artists have loved for ages.

Then came a thrilling discovery in 2023: mathematicians found a single tile, nicknamed the "hat", that covers a whole floor without ever repeating. People had searched for such a shape for over fifty years, and it turned out to be something you could cut out of paper.

Packing You Cannot Even Picture

Packing does not stop at the flat page or the fruit stand. Mathematicians ask about packing balls in higher dimensions — spaces with four, eight, even twenty-four directions instead of our usual three. You cannot picture it, but the math still works.

In 2016, a mathematician named Maryna Viazovska solved the packing problem in eight dimensions, and her proof was so elegant and surprising that she won the Fields Medal, often called the "Nobel Prize of mathematics." It is one of the rare cases where we know the perfect packing for certain.

Can You Get the Couch Around the Corner?

There is a cousin of packing that asks not "does it fit?" but "can you move it into place?" The most famous example is the moving sofa problem: what is the largest sofa you can slide around a right-angled corner in a hallway? Anyone who has helped move furniture knows the frustration. Mathematicians posed it in 1966, and after almost sixty years it was finally answered in 2024. A real-life headache turned into a beautiful theorem.

A Roll Call of Famous Packing Problems

Packing is not one puzzle but a whole family of them. Here are a few more that mathematicians (and computer scientists) love — each one easy to describe, and some still unsolved:

• The knapsack problem. You are a hiker with a backpack that holds only so much weight. Every item has a value; which items do you take to get the most value without overpacking? It sounds simple, yet nobody knows a fast method that always finds the perfect answer. It is tied to the famous P versus NP question — a million-dollar unsolved problem about what computers can and cannot do quickly.
• Bin packing. Given a pile of boxes of different sizes, how do you fit them into the fewest trucks? Shipping companies, warehouses, and even the apps that split files across disks wrestle with this every day. Like the knapsack, a perfect solution is thought to be impossibly slow, so people use clever "good enough" rules instead.
• Squaring the square. Can you tile a big square using smaller squares that are all different sizes, with no gaps and no overlaps? For years people doubted it was even possible — then in 1939 a group of students found one. The smallest such "perfect squared square" needs exactly 21 pieces.
• The sausage conjecture. Here is one with the best name in math. If you pack balls in high-dimensional space, sometimes lining them up in a straight row — a "sausage" — wastes less room than clumping them together. Mathematician László Fejes Tóth guessed exactly when the sausage wins, and in dimensions above 42 it is still an open question.
• Spreading points on a sphere. How do you place a handful of dots on a globe so that they are as far apart from one another as possible? This is the Tammes problem, first asked by a botanist studying the pores on grains of pollen. It shows up again in the dimples of a golf ball and the seams of a soccer ball.
• Circle packing in a square. How many equal coins can you cram into a square tray? For small numbers the best arrangements are known and often surprising — they are not always the neat grid you would expect — but for many sizes the true best packing is still a mystery.

A Timeline of Big Breakthroughs

Some of these puzzles waited centuries for an answer. Here are a few of the great "solved at last!" moments:

• 1611 — Kepler guesses the orange-stack is the tightest sphere packing.
• 1939 — Students build the first perfect squared square.
• 1966 — The moving sofa problem is posed.
• 1970s — Penrose finds tiles that never repeat.
• 1998 — Thomas Hales proves the Kepler conjecture, almost 400 years later.
• 1999 — The honeycomb conjecture is proved; the bees were right.
• 2016 — Maryna Viazovska solves sphere packing in 8 dimensions, later winning the Fields Medal.
• 2023 — The single "hat" tile that never repeats is discovered.
• 2024 — The moving sofa problem is finally answered.

Notice how many of these are recent. Packing is a living subject — new pieces of it are still being fitted into place today.

Why a Computer Can Be Sure

Here is something special about packing. The question "do these two pieces overlap?" has a clear, honest answer: yes or no. If we use exact whole-number arithmetic instead of rounded-off decimals, a computer can prove a packing is correct — no guessing, no "close enough." That means when you finish a board in this app, it is not just probably right; it is provably right. The math is something you can trust.

Last Words

Packing is one of those rare ideas that lives in two worlds at once. It is a deep, serious branch of mathematics, full of centuries-old mysteries and prize-winning proofs. And it is also pure play — falling blocks, fitted tiles, fruit in a jar. The next time you wedge that last bag into the trunk, remember: you are practicing the same puzzle that has fascinated bees, grocers, and the greatest mathematicians in history.