Every Square on the Board
The puzzle
An 8 by 8 chessboard obviously contains 64 small squares. But it also contains 2 by 2 squares, 3 by 3 squares, and so on up to the whole board.
How many squares of all sizes does the board contain?
Stuck?
One at a time, smallest first. Open only as many as you need — the whole point of the puzzle is the part you work out yourself.
Hint 1
Count each size separately. How many positions can a 2 by 2 square occupy?
Hint 2
A k by k square's top-left corner can sit in any of (9-k) rows and (9-k) columns.
Show the answer Hide the answer
204 squares in all.
How to get there
Fix a size k. A k by k square is pinned down by its top-left cell, which can be in any of the first 9-k columns and any of the first 9-k rows - any further right or down and the square falls off the board. So there are (9-k)^2 of them.
That gives 64 of size 1, 49 of size 2, 36 of size 3, then 25, 16, 9, 4 and finally 1 of size 8.
Adding: 64 + 49 + 36 + 25 + 16 + 9 + 4 + 1 = 204. It is the sum of the first eight perfect squares, so an n by n board holds n(n+1)(2n+1)/6 squares - for n = 8, 8*9*17/6 = 204.
The technique worth keeping
Partition the count by a parameter - here the size - and count each class by what determines a member of it. One corner determines a square, so counting legal corners counts squares exactly once each.