Problem:
Gerry is playing the Triples Game. Her task is to partition the grid of squares shown on the left into three sections, each containing three adjoining squares. (Three squares are adjoining if each shares an edge with at least one of the other two.) One point will be awarded for each section containing more X's than O's. Shown on the right is a sample partition that will earn one point in total. A partition that earns two or more points will win the game. What fraction of the possible partitions of this particular grid will result in a win for Gerry?
Answer Choices:
A.
B.
C.
D.
E.
Solution:
Step 1: Count all partitions. Each section is either a straight piece () or an L-shaped piece.
Claim. Every partition uses one full side of the grid (the top row, bottom row, left column, or right column) as a section.
Proof. Look at the section containing the center square.
Once a full side is used, the remaining rectangle can be split in ways (two straight pieces, or two L's in ways). That gives , but the all-rows partition is counted twice (top and bottom) and so is the all-columns partition. So there are partitions in all.
Step 2: Count the winning partitions. The grid has only X's. A section scores a point when it has at least X's, so a winning partition needs two sections with exactly X's each. Checking all partitions:
Exactly of the partitions win, so the fraction is
The problems and solutions on this page are the property of the MAA's American Mathematics Competitions