The problem of pawns

MaRDI QIDQ2315442zbMATH OpenFDO

Authors Tricia Muldoon Brown

Publication date 5 August 2019

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1811.09606, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i3p21

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

counting the number of maximum arrangemet

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Orthogonal arrays, Latin squares, Room squares (05B15)

Abstract: Using a bijective proof, we show the number of ways to arrange a maximum number of nonattacking pawns on a $2mimes2m$ chessboard is ${2mchoosem}^2$, and more generally, the number of ways to arrange a maximum number of nonattacking pawns on a $2nimes2m$ chessboard is ${m+nchoosen}^2$.

Recommendations

• The problem of the pawns
• The problem of the kings
• Nonattacking queens in a rectangular strip
• Queens on non-square tori

Cites work

• scientific article; zbMATH DE number 6000878 (Why is no real title available?)
• scientific article; zbMATH DE number 2108952 (Why is no real title available?)
• scientific article; zbMATH DE number 3199765 (Why is no real title available?)
• On directed-convex polyominoes in a rectangle
• The problem of kings
• The problem of the pawns

Cited in

(7)

• The problem of the moody chess players
• Queens, attack!
• On the distribution of non-attacking bishops on a chessboard \(C\)
• The problem of the pawns
• THE TWO GUARDS PROBLEM
• The problem of the kings
• scientific article; zbMATH DE number 5663730 (Why is no real title available?)

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: The problem of pawns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2315442)