Ways to Place Counters on 2mx2n board
Source: 2019 Canadian Mathematical Olympiad Problem 3
March 28, 2019
combinatoricstilingscheckerboardcombinatorics solvedgridsBijectionsinduction
Problem Statement
You have a by grid of squares coloured in the same way as a standard checkerboard. Find the total number of ways to place counters on white squares so that each square contains at most one counter and no two counters are in diagonally adjacent white squares.