The problem of maximizing the radius of n equal circles that can be packed into a given square is a well-known geometrical problem.It is equivalent to the problem of scattering n points in a square so that the minimum distance between any two points is as large as possible.The optimal packings of at most 20 circles are known,and probably best packings found by computational methods are published for 21 5 5 We survey the results for 21 5 5 and present better packings for n =34.