MathDB

C1

Part of 2019 Pan-African Shortlist

Problems(1)

How many non-attacking pawns can be placed on a $n \times n$ chessboard?

Source: 2019 Pan-African Shortlist - C1

1/18/2021
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×nn \times n chessboard such that no two pawns attack each other?
combinatorics