The problem of the pawns

Details The problem of the pawns The problem of the pawns

2003-05-18

arxiv.org/abs/math/0305253v1

Mathematics

Combinatorics

16 pages; 6 figures

Scientific paper

In this paper we study the number $M_{m,n}$ of ways to place nonattacking pawns on an $m\times n$ chessboard. We find an upper bound for $M_{m,n}$ and analyse its asymptotic behavior. It turns out that $\lim_{m,n\to\infty}(M_{m,n})^{1/mn}$ exists and is bounded from above by $(1+\sqrt{5})/2$. Also, we consider a lower bound for $M_{m,n}$ by reducing this problem to that of tiling an $(m+1)\times (n+1)$ board with square tiles of size $1\times 1$ and $2\times 2$. Moreover, we use the transfer-matrix method to implement an algorithm that allows us to get an explicit formula for $M_{m,n}$ for given $m$.

Affiliated with

Also associated with

No associations

Rating

The problem of the pawns does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The problem of the pawns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The problem of the pawns will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-604289