  Using a bijective proof, we show the number of ways to arrange a maximum
number of nonattacking pawns on a $2m\times 2m$ chessboard is ${2m\choose
m}^2$, and more generally, the number of ways to arrange a maximum number of
nonattacking pawns on a $2n \times 2m$ chessboard is ${m+n\choose n}^2$.
