The Problem of Pawns [article]

Tricia Muldoon Brown
2018 arXiv   pre-print
Using a bijective proof, we show the number of ways to arrange a maximum number of nonattacking pawns on a 2m× 2m chessboard is 2m m^2, and more generally, the number of ways to arrange a maximum number of nonattacking pawns on a 2n × 2m chessboard is m+n n^2.
arXiv:1811.09606v1 fatcat:nialy2ytjbaxxcv4ax3sut6qnm