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

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

IGraph/M Documentation

Rook polynomial - Wikipedia

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

Algorithms, Free Full-Text

PPT - COSC 4426 Topics in Computer Science II Discrete Optimization PowerPoint Presentation - ID:3997011

IJMS, Free Full-Text

Solved JUnit: R2I2Test.javal Create a new class named P2J2

Jeff Somers's N Queens Solutions