I would like instead to cover a circle of maximum radius with n non-overlapping unit squares.
The n=3 problem is solved. Try 4, 5, 6, 7, and 8. (Feel free to keep going. I've done up to 36, but that's a bit excessive.)
flooble's webmaster puzzle