Geodesic
The problem of pawns
Tricia Muldoon Brown1
1Georgia Southern University
The electronic journal of combinatorics, Tome 26 (2019) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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$.
DOI : 10.37236/8312
Classification : 05B15, 05A19
Mots-clés : counting the number of maximum arrangemet

Tricia Muldoon Brown  1

1 Georgia Southern University 
@article{10_37236_8312,
     author = {Tricia Muldoon Brown},
     title = {The problem of pawns},
     journal = {The electronic journal of combinatorics},
     year = {2019},
     volume = {26},
     number = {3},
     doi = {10.37236/8312},
     zbl = {1417.05019},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/8312/}
}
TY  - JOUR
AU  - Tricia Muldoon Brown
TI  - The problem of pawns
JO  - The electronic journal of combinatorics
PY  - 2019
VL  - 26
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/8312/
DO  - 10.37236/8312
ID  - 10_37236_8312
ER  - 
%0 Journal Article
%A Tricia Muldoon Brown
%T The problem of pawns
%J The electronic journal of combinatorics
%D 2019
%V 26
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/8312/
%R 10.37236/8312
%F 10_37236_8312
Tricia Muldoon Brown. The problem of pawns. The electronic journal of combinatorics, Tome 26 (2019) no. 3. doi: 10.37236/8312

Cité par Sources :