Dividing along the gridlines, divide an NxN square in to the maximum number of pieces, such that each piece is unique (including rotations and reflections.) Solve for N<=8. For example, for N=3, you can divide a 3x3 square into four pieces of sizes (3,3,2,1).
Source: Original.