Rooks Problem -- from Wolfram MathWorld

The rook is a chess piece that may move any number of spaces either horizontally or vertically per move. The maximum number of nonattacking rooks that may be placed on an n×n chessboard is n. This arrangement is achieved by placing the rooks along the diagonal (Madachy 1979). The total number of ways of placing n nonattacking rooks on an n×n board is n! (Madachy 1979, p. 47). In general, the polynomial R_(mn)(x)=sum_(k)r_k^((m,n))x^k whose coefficients r_k^((m,n)) give the

Rook Polynomial -- from Wolfram MathWorld

Math Games: Chessboard Tasks

The 8-Queens Problem - MATHTICIAN

Chained permutations and alternating sign matrices—Inspired by three-person chess - ScienceDirect

4_The Putnam Mathematica Competition (2001-2008).AMS by Fredi Luarasi - Issuu

n-rooks-solver/README.md at master · zealoushacker/n-rooks-solver · GitHub