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.)
Oh, yeah, of course, and a few 8:15:17 triangles.
So for n=6, r=17/16
flooble's webmaster puzzle