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

PDF) Use of Several Grids in the Knight Tour's Game to Find Shorter or Longer Biochemistry's Sentences

Wolfram, Alpha Meets MathWorld—Wolfram

PPT - Solving N+k Queens Using Dancing Links PowerPoint Presentation, free download - ID:5415379

discrete mathematics - n-rooks n-colors problem - Mathematics Stack Exchange

Wolfram, Alpha: The First Year—Wolfram

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

Rooks Problem -- from Wolfram MathWorld

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

list manipulation - Solving chess bishop problem - Mathematica Stack Exchange

Rook Polynomials: A Straight-Forward Problem – Feature Column

The Philosophy Program at LaGuardia Community College

Schaum's Outline of Mathematica, 2ed (Schaum's Outlines) 2, Don, Eugene

Research and Publications at Previous REU Programs - The REU Program In Mathematics - Grand Valley State University

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

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