Common
Circle packing in a square
Two-dimensional packing problem
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. To convert between these two formulations of the problem, the square side for unit circles will be L = 2 + 2/dn.
Open boosters, collect cards and trade them. Free to play.
Play for free