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

The Philosophy Program at LaGuardia Community College

Mathematica on the cheap [ David Antler ]

In how many ways can you arrange eight queens on a standard chessboard in such a way that none of them is attacking any other? - Quora

Rook Complement Graph -- from Wolfram MathWorld

Yet Another Math Programming Consultant: More queens problems

Solved Let B be the 8 by 8 chessboard with forbidden cells

How 8 Queens Works

Rook Number -- from Wolfram MathWorld

Rook Polynomial -- from Wolfram MathWorld

IGraph/M Documentation

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