Unverified50% confidenceFactExact time
The best known optimal solution for packing n=11 squares compresses the side length of the enclosing square to approximately 3.8772.
1
Sources
50%
Confidence
Long-term
Relevance
10/7/2026
First Seen
Sources
Related Entities
Cite This Claim
Stable URI
https://kongchang.com/claim/984792API
curl https://kongchang.com/api/v1/knowledge/claims/984792MCP
get_claim(id=984792)