{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T03:29:55Z","timestamp":1774409395429,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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$.<\/jats:p>","DOI":"10.37236\/8312","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T02:04:49Z","timestamp":1578621889000},"source":"Crossref","is-referenced-by-count":4,"title":["The Problem of Pawns"],"prefix":"10.37236","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3835-1175","authenticated-orcid":false,"given":"Tricia Muldoon","family":"Brown","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2019,8,2]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i3p21\/7881","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i3p21\/7881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T23:10:57Z","timestamp":1579216257000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v26i3p21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,2]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,7,4]]}},"URL":"https:\/\/doi.org\/10.37236\/8312","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,2]]},"article-number":"P3.21"}}