For decades, one simple-sounding geometry puzzle sat stubbornly unsolved, outliving generations of researchers and endless computer experiments. Now a 31‑year‑old mathematician from South Korea has brought it to a close, armed not with supercomputers, but with pencil, paper and a very patient mind.
The strange saga of the moving sofa problem
Back in 1966, Austrian‑Canadian mathematician Leo Moser asked a question that any homeowner might recognise. Picture a corridor shaped like an L, each arm one metre wide. What is the largest rigid flat shape you can carry around the corner without lifting or bending it?
This puzzle became known as the “moving sofa problem”. It sounds like something from a student flatshare, yet it quickly turned into a legendary challenge in geometry. The task is to maximise the area of a shape that can squeeze through that right‑angled turn.
Early on, mathematicians proposed candidates rather than exact answers. In 1968, John Hammersley came up with a shape that could manage an area of about 2.2074 square metres. That was already larger than a simple rectangle or circle would allow.
In 1992, American mathematician Joseph Gerver pushed the boundary further. He designed an intricate, curved shape with several distinct arcs and corners. Its area was around 2.2195 square metres, and it became the reigning champion.
For over thirty years, Gerver’s bizarre, many‑curved sofa shape stood as the best guess, but nobody could prove it was unbeatable.
Computer simulations suggested that no larger sofa should fit. Still, simulations can only test particular shapes and approximations. They never brought a definitive, mathematical “no larger shape exists”. The door remained slightly open to the possibility that a smarter design might do better.
A conscript discovers a 60‑year‑old riddle
The turning point came from an unexpected place: South Korea’s mandatory military service. During his placement at the National Institute for Mathematical Sciences, young mathematician Baek Jin‑eon stumbled across the moving sofa problem.
What caught his attention was not just its fame, but its vagueness. There was no widely accepted theoretical framework, no neat formula, just an awkward question that had drifted through applied mathematics since the 1960s.
➡️ Astronomers confirm the century’s longest eclipse will briefly turn day into night
➡️ Why drying clothes near radiators increases indoor dust — and how to stop it
➡️ The simple reason some rooms echo more than others
➡️ Royal family country estate with eight bedrooms and pool up for sale scandale immobilier
That absence of structure became Baek’s motivation. He started thinking about how to turn this informal puzzle into a precise optimisation problem, with clear constraints and tools.
Seven years, 119 pages and no computers
Baek continued to work on the problem through his PhD at the University of Michigan and later at the June E. Huh Center for Mathematical Challenges at the Korea Institute for Advanced Study.
Over roughly seven years, he built a full proof from the ground up. No numerical search, no symbolic software, no machine assistance. Just a chain of precise arguments that had to survive every self‑posed objection.
His final manuscript runs to 119 pages and argues that Gerver’s shape is not just good, but absolutely optimal.
The key breakthrough lies in how Baek formalised the puzzle. Instead of treating it as a vague question about “shapes that fit”, he encoded every possible motion of a shape through an L‑shaped corridor into a rigorous mathematical setting. That allowed him to phrase the challenge as an optimisation problem with strict upper bounds.
Within this framework, Baek proves that any shape which manages to move around the corner must have an area at most equal to Gerver’s. Since Gerver’s construction reaches that limit, no sofa larger than 2.2195 square metres can succeed.
What makes this proof stand out
- It provides the first exact upper bound matching a known construction.
- It avoids reliance on numerical approximations or computer searches.
- It introduces a reusable framework for similar geometric optimisation problems.
The work has been posted on the scientific preprint server arXiv and is under review at the prestigious journal Annals of Mathematics, a venue reserved for results that can reshape fields.
A reminder of what pure thought can do
Baek often describes his process as a cycle of hope and collapse. In interviews with Korean media, he has spoken of repeatedly believing he saw the full picture, only to find a gap and dismantle months of work.
“You keep a bit of hope, then crush it, and move forward picking ideas from the ashes,” he said, likening the process to a chain of dreams and awakenings.
At just 31, he continues to work in combinatorial geometry and optimisation, in a research environment that is rapidly boosting South Korea’s visibility in pure mathematics. His moving‑sofa result showcases a style of research that feels almost old‑fashioned in the age of AI and massive computation: patient, solitary, heavily conceptual.
The success also offers a subtle counter‑argument to the belief that big mathematical advances now belong mainly to machines. For this particular question, at least, human persistence and abstract thinking produced the final word.
Why a “sofa problem” matters
On the surface, negotiating a hallway with a theoretical sofa looks like a curiosity. Yet the ideas behind it echo across more practical areas.
Any situation where a rigid object must move through a constrained space raises similar questions: how big can the object be, what paths are allowed, and what configuration maximises some quantity under those rules?
| Field | Related question |
|---|---|
| Robotics | Finding collision‑free paths for robot arms in cramped factories. |
| Logistics | Planning how to manoeuvre large loads through warehouses or city streets. |
| Computer graphics | Computing feasible motions of objects in animation or virtual reality. |
| Manufacturing | Checking whether parts can be inserted into machines without disassembly. |
In all these settings, researchers talk about “configuration spaces”. Instead of only describing where an object is, they track every possible way it could be positioned and rotated. The moving sofa problem is a particularly tricky instance where the geometry of that configuration space becomes highly tangled.
From puzzle to broader ideas
The techniques Baek developed could shed light on other geometric puzzles that have resisted exhaustive computation. For instance, similar reasoning might help with shapes sliding through different kinds of corridors, or with three‑dimensional versions where a rigid body needs to twist around obstacles.
There is also a cultural dimension. Puzzles like the moving sofa problem often appear in popular maths books, classroom discussions and outreach talks. Having a final, rigorous answer allows teachers and communicators to show students how a casual‑sounding question can grow into a serious line of research involving optimisation, topology and analysis.
For readers not used to mathematical jargon, a couple of terms help frame what Baek accomplished. “Optimisation” here means finding the best possible object that satisfies all the constraints, not just a decent candidate. “Rigorous proof” means a chain of arguments so tight that every step can be justified from accepted axioms and prior results, leaving no room for guesswork or unchecked assumptions.
One way to picture the impact is to imagine architects trying to design the largest piece of modular furniture that will fit through a fixed stairwell. For years they relied on intuition, mock‑ups and 3D models, unsure whether a slightly larger design might still squeak through. With an argument like Baek’s, they would finally know the absolute upper bound. No amount of extra cleverness could beat it.
The moving sofa problem now sits in that category: a 60‑year‑old uncertainty turned into a clean, if intricate, theorem. The riddle about a corridor, an angle and a hypothetical sofa has become a landmark in how far sheer reasoning can go when given time, focus and a question that refuses to let go.