MathDB
BMT 2021 Guts Round p13

Source:

October 7, 2022
combinatorics

Problem Statement

How many ways are there to completely fill a 3×33 \times 3 grid of unit squares with the letters B,MB, M, and TT, assigning exactly one of the three letters to each of the squares, such that no 22 adjacent unit squares contain the same letter? Two unit squares are adjacent if they share a side.