The problem of pawns

Tricia Muldoon Brown

doi:10.37236/8312

The problem of pawns

Tricia Muldoon Brown

Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

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)², and more generally, the number of ways to arrange a maximum number of nonattacking pawns on a 2n × 2m chessboard is (^m+n _n)².

Original language	English
Article number	P3.21
Journal	Electronic Journal of Combinatorics
Volume	26
Issue number	3
DOIs	https://doi.org/10.37236/8312
State	Published - 2019

Scopus Subject Areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.37236/8312

Cite this

@article{0d4848dfa9274a0594caee44c8c5e42d,

title = "The problem of pawns",

abstract = "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.",

author = "Brown, {Tricia Muldoon}",

note = "Publisher Copyright: {\textcopyright} The author.",

year = "2019",

doi = "10.37236/8312",

language = "English",

volume = "26",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "3",

}

TY - JOUR

T1 - The problem of pawns

AU - Brown, Tricia Muldoon

N1 - Publisher Copyright: © The author.

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85070699852&partnerID=8YFLogxK

U2 - 10.37236/8312

DO - 10.37236/8312

M3 - Article

AN - SCOPUS:85070699852

SN - 1077-8926

VL - 26

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 3

M1 - P3.21

ER -

The problem of pawns

Abstract

Scopus Subject Areas

Access to Document

Other files and links

Cite this