Densest packing of six equal circles in a square (Q1327867)

Using a suitable centrally symmetric partition of the unit square \(S\) into nine regions, the author derives the densest packing of \(n = 6\) congruent circles inside \(S\). In addition, a survey on results for other values of \(n\) is given. It should be remarked that an analogous approach was given by \textit{B. L. Schwarz} [J. Recreational Math. 3, 195-204 (1970)].