Consider a 16x16 square subdivided by grid lines into unit squares. It is easy to completely tile (no overlaps, no gaps) this square with 64 1x4 rectangles. Each 1x4 rectangle in the tiling (no matter whether horizontally or vertically oriented), will be split into two non-empty regions by exactly three grid lines.
For example, see the diagram below where there are three bolded grid lines which each split the red 1x4 rectangle into two non-empty regions. The leftmost and rightmost bolded grid lines each split the 1x4 rectangle into two regions (a unit square and a 1x3 rectangle). The middle bolded grid line splits the 1x4 rectangle into two 1x2 rectangles.
The goal of this puzzle is to completely tile (no overlaps, no gaps) this 16x16 square with 64 1x4 rectangles to maximize the number of grid lines that split at least one 1x4 rectangle into two non-empty regions.
Clarification: You may position a 1x4 rectangle in the position shown in the diagram BUT that is not a requirement.