AMC12 2009 B

We need to find a reasonably easy way to count the squares. First, obviously the maximum distance between two points in the same quadrant is $4\sqrt 2 < 6$, hence each square has exactly one vertex in each quadrant. Given any square, we can circumscribe another axes-parallel square around it. In the picture below, the original square is red and the circumscribed one is blue. Let's now consider the opposite direction. Assume that we picked the blue square, how many different red squares do share it? Answering this question is not as simple as it may seem. Consider the picture below. It shows all three red squares that share the same blue square. In addition, the picture shows a green square that is not valid, as two of its vertices are in bad locations. The size of the blue square can range from $6\times 6$ to $14\times 14$, and for the intermediate sizes, there is more than one valid placement. We will now examine the cases one after another. Also, we can use symmetry to reduce the number of cases. Summing the last column, we get that the answer is $\boxed{225}$.