Dudeney’s Dissection: Triangle to Square in 4 Pieces

Quick answer: Dudeney’s dissection, also called the haberdasher’s puzzle, divides an equilateral triangle into four pieces that rearrange into a square of the same area. Four is the minimum for polygonal pieces moved by sliding and rotating without flipping. Erik Demaine, Tonan Kamata and Ryuhei Uehara announced the optimality proof in December 2024, and it was published at ITCS 2026.

Take an equilateral triangle. Make three straight cuts to get four pieces. Rearrange them, and you have a perfect square. The puzzle is more than 120 years old, and it was always natural to ask whether three pieces could do it. In 2024 three mathematicians finally proved the answer is no.

The Puzzle

In 1902, the English puzzle writer Henry Ernest Dudeney published the “Haberdasher’s Puzzle”: cut an equilateral triangle into pieces that form a square. He credited C. W. McElroy with submitting a four-piece solution. The puzzle later appeared as “The Haberdasher’s Puzzle” in The Canterbury Puzzles. Dudeney also described a model of polished mahogany with brass hinges, exhibited in 1905: its four connected pieces close one way into a triangle and the other way into a square. For a step-by-step cutting template, see Archimedes’ Lab.

FeatureRules for the optimality result
Start and finishEquilateral triangle to a square of the same area
PiecesPolygons
Allowed movesSliding and rotating
FlippingNot allowed
Finished shapeFully covered, no overlaps

The Math Behind It

The square must have the same area as the triangle. If the triangle has side 1, its area is \(\tfrac{\sqrt3}{4} \approx 0.433\), so the square has side

\[ s = \sqrt{\tfrac{\sqrt3}{4}} = \tfrac{\sqrt[4]{3}}{2} \approx 0.658. \]

ShapeSideAreaPerimeter
Equilateral triangle1about 0.4333
Squareabout 0.658about 0.433about 2.632

Same area, different perimeter: rearranging changes which piece edges form the outside boundary. Some edges that were on the outside become internal, and some internal cut edges become part of the boundary. Note that the theorem counts pieces, not cutting strokes. The Bolyai–Gerwien theorem guarantees that any two polygons of equal area can be cut into finitely many pieces that rearrange into each other, but it says nothing about the fewest pieces.

Why Two Pieces Cannot Work

Take the triangle with side 1. Any two of its corners are 1 unit apart. The square of equal area has diagonal \(\sqrt{2} \times 0.658 \approx 0.931\), so no two points inside it are 1 unit apart. A rigid piece containing two triangle corners therefore cannot fit in the square. With three corners and only two pieces, one piece must contain two corners, so two pieces is impossible.

Why Is Three Pieces Impossible?

Erik Demaine (MIT), Tonan Kamata and Ryuhei Uehara (JAIST) posted “Dudeney’s Dissection is Optimal” on arXiv on December 5, 2024. They proved that the equilateral triangle and the square have no common dissection into three or fewer polygonal pieces, when pieces may be translated and rotated but must not overlap.

  • Three pieces needed a long case analysis. The authors classified every way three pieces could fit in the triangle and in the square, then showed every combination leads to a contradiction, using how edges and corners must match up.
  • What stays open: versions that allow flipping pieces over, or curved cuts, are not covered by the theorem.

The paper was peer reviewed and published at the ITCS 2026 conference in January 2026.

Try It Yourself

Print a cutting template (Archimedes’ Lab and many puzzle sites have one), cut out the four pieces, and slide and rotate them into a square without flipping. Then check the math: if your triangle has side 10 cm, its area is about 43.3 cm², so the square’s side should be about 6.58 cm. Measure it.

Common Misconceptions

“Any shape can be turned into any other with a few cuts.” Equal-area polygons can always be dissected into each other, but the number of pieces can be large, and finding the minimum is usually very hard.

“Three pieces is impossible, full stop.” Only under the stated rules: polygonal pieces, sliding and rotating, no flipping. The flipped and curved versions are open.

Watch: Dudeney’s Dissection in Video

If you learn better by watching, these videos are worth your time.

Dudeney’s Dissection (Grand Illusions). A physical hinged model swinging between triangle and square.
Dudeney’s Dissection is Optimal (Kamata Tonan). A talk by one of the authors of the 2024 proof.

Check Your Understanding

Five quick questions to see how much of this has stuck. Pick an answer and press Submit; you will see a short explanation either way.

Answer each question and press Submit to see your result right away.

1. How many pieces does Dudeney’s dissection use?
Found a bug? Let us know!
2. What did the 2024 proof show?
Found a bug? Let us know!
3. If the triangle has side 1, what is the square’s side approximately?
Found a bug? Let us know!
4. Which theorem says equal-area polygons can always be dissected into each other?
Found a bug? Let us know!
5. If the triangle has side 10 cm, what is the equal-area square’s side?
Found a bug? Let us know!

Frequently Asked Questions

What is Dudeney’s dissection?

It is a way to cut an equilateral triangle into four pieces that rearrange into a square of the same area, also called the haberdasher’s puzzle. Henry Dudeney published it in 1902, crediting C. W. McElroy with the solution.

Can a triangle be turned into a square with three pieces?

No. In 2024, Erik Demaine, Tonan Kamata and Ryuhei Uehara proved that an equilateral triangle and a square have no common dissection into three or fewer polygonal pieces, so Dudeney’s four pieces is optimal for pieces that slide and rotate without flipping.

Who proved Dudeney’s dissection is optimal?

Erik Demaine, Tonan Kamata and Ryuhei Uehara, in a paper posted in December 2024 and published at the ITCS 2026 conference.

Can the pieces be hinged?

Yes. Dudeney’s four pieces can be joined by hinges in a chain that folds from the triangle to the square and back.

Keep Exploring

Sources and Further Reading

Related to This Article

What people say about "Dudeney’s Dissection: Triangle to Square in 4 Pieces - Effortless Math"?

No one replied yet.

Leave a Reply