Combinatorics Arrangement Problem This is a combinatorics question:


*

*Imagine you have an $8\times8$ empty chessboard.

*You have $10$ identical pawns.

*How many different ways can you place those $10$ pawns on the chessboard such that each pawn is at least (Euclidean) distance $X$ away from any of the other pawns?

*This is just an example, but what I would like is a function where I can give it the dimensions of the chessboard, the number of pawns that must be on the chessboard, and the minimum distance each pawn must be from any of the other pawns, and then the function returns the number of possible arrangements.

*If you don't know how to solve this problem, could you please let me know what subfield of combinatorics that I can learn to solve this problem? For example, is there a clever way of using inclusion-exclusion to solve this problem?

*Lastly, if the above problem is too hard, how would you do this if instead of a chessboard that is $8\times 8$, you had a long board that was $64\times 1$? 
Thanks!
 A: For the linear problem (on $p\times1$), this is relatively easy. I give an example : you have 4 pawns that must be at distance 8 (adjacent pawns are at distance 1) on a $30\times 1$ board.
So the first pawn can be on cell 1, the second can be on cell 9, the third on cell 17 and the last on cell 25. This is the right most solution, and so the last pawn can only be on cell $p_{4}$ with $25\le p_4 \le 30$.
Once you have fixed $p_4$, then you can verify that $p_1=1+a_1$, $p_2=p_1+8+a_2$, $p_3=p_2+8+a_3$ and $p_4=p_8+8+a_4$, with $a_1+a_2+a_3+a_4=p_4-25$ (and $a_i\ge 0$). How many different $a_i$ verify this ? $\binom{p_4-25+3}{3}$.
So the number you want to find would be : $\sum_{p=25}^{30}\binom{p-25+3}{3}$=$\sum_{p=0}^{5}\binom{p+3}{3}$.
For 10 pawns on a $64\times 1$ lane, with distance $1\le X\le 7$, it would be 
$$\sum_{p=0}^{63-9X}\binom{p+9}{9}=1+10+55+220+\dots$$.
On a 2 dimensional board, this is (I think) an open question, even for $X=2$. For example the hard square entropy is a problem when we want to know how many ways you can put pawns on a square board with $X=2$ (you can have any number of pawns). No close formula is known to answer this problem. But for small size board, this was computed by computers.
