Square-Bracing Problem/Non-Crossing Rods
Classic Problem
Let there be an unlimited supply of rigid rods of unit length which may be joined together at their ends with a hinged joint.
Let $4$ of these rods be used to construct a square.
How many more of these rods are needed to make the square rigid?
Rods are not allowed to cross.
Solution
This solution uses $23$ rods:
![]() | This theorem requires a proof. In particular: Minimality to be proved. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Sources
- 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $23$
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $23$
- Weisstein, Eric W. "Braced Polygon." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/BracedPolygon.html

