The densest packings of n equal circles in a square have been determined ea
rlier for n less than or equal to 20 and for n = 25, 36. Several of these p
ackings have been proved with the aid of a computer. The computer-aided app
roach is further developed here and the range is extended to n less than or
equal to 27. The optimal packings are depicted.