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

Rooks Problem -- from Wolfram MathWorld

Rook polynomial - Wikipedia

Using Boolean Computation to Solve Some Problems from Ramsey Theory « The Mathematica Journal

Rook Polynomials: A Straight-Forward Problem – Feature Column

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

IGraph/M Documentation

How many ways are there to place two identical rooks on a standard 8x8 checkerboard so that they are attacking each other? - Quora

Mathematica on the cheap [ David Antler ]

Posts Tagged with 'Advanced Math'—Wolfram