14. (10 points) In the $8 \times 8$ table of Figure 2, there are 168 "T" shapes as shown in Figure 1. Now, each small square in Figure 2 is colored black or white; if a "T" shape contains 2 black and 2 white small squares, it is called "harmonious"; then, for all coloring schemes of Figure 2, the maximum number of "harmonious" "T" shapes is $\qquad$.
【Solution】Solution:
(1) Color the $8 \times 8$ grid array as shown in Figure 2. The number of shape 3 contained is: the first and eighth rows from left to right have none; the second, fourth, and sixth rows each have 2; the third, fifth, and seventh rows each have 1; totaling $(2+1) \times 3=9$. From right to left, from top to bottom, and from bottom to top, each is 9, so the total is $9 \times 4=36$.
(2) Each shape 3 contains 4 shape 1s. If shape 1 is "harmonious" with 2 black and 2 white, then each shape 3 can have at most 3 "harmonious" shape 1s. Therefore, shape 2 must have at least 36 shape 1s that are not "harmonious".

Thus: The maximum number of "harmonious" shape 1s in shape 2 is: $168-36=132$ (pieces).