Problem

Source: 2019 Pan-African Shortlist - C1

Tags: combinatorics



A pawn is a chess piece which attacks the two squares diagonally in front if it. What is the maximum number of pawns which can be placed on an $n \times n$ chessboard such that no two pawns attack each other?