Circle packing in a square
Circle packing in a square is a packing problem in recreational mathematics where the aim is to pack n unit circles into the smallest possible square. Equivalently, the problem is to arrange n points in a unit square in order to maximize the minimal separation, dn, between points.
Source: Wikipedia — Circle packing in a square (CC BY-SA 4.0)