Rook polynomial
generating polynomial of the number of ways to place k non-attacking rooks on a m×n chessboard
In combinatorial mathematics, a rook polynomial is a generating polynomial of the number of ways to place non-attacking rooks on a board that looks like a checkerboard; that is, no two rooks may be in the same row or column. The board is any subset of the squares of a rectangular board with m rows and n columns; we think of it as the squares in which one is allowed to put a rook. The board is the ordinary chessboard if all squares are allowed and m = n = 8 and a chessboard of any size if all squares are allowed and m = n. The coefficient of x k in the rook polynomial RB(x) is the number of ways k rooks, none of which attacks another, can be arranged in the squares of B. The rooks are arranged in such a way that there is no pair of rooks in the same row or column. In this sense, an arrangement is the positioning of rooks on a static, immovable board; the arrangement will not be different if the board is rotated or reflected while keeping the squares stationary. The polynomial also remains the same if rows are interchanged or columns are interchanged.
The term "rook polynomial" was coined by John Riordan.
Despite the name's derivation from chess, the impetus for studying rook polynomials is their connection with counting permutations (or partial permutations) with restricted positions. A board B that is a subset of the n × n chessboard corresponds to permutations of n objects, which we may take to be the numbers 1, 2, ..., n, such that the number aj in the j-th position in the permutation must be the column number of an allowed square in row j of B. Famous examples include the number of ways to place n non-attacking rooks on:
an entire n × n chessboard, which is an elementary combinatorial problem;
the same board with its diagonal squares forbidden; this is the derangement or "hat-check" problem (this is a particular case of the problème des rencontres);
the same board without the squares on its diagonal and immediately above its diagonal (and without the bottom left square), which is essential in the solution of the problème des ménages.
Interest in rook placements arises in pure and applied combinatorics, group theory, number theory, and statistical physics.
The public source identifies “Rook polynomial” as generating polynomial of the number of ways to place k non-attacking rooks on a m×n chessboard. This brief keeps that definition visible, then builds a research path around Rook, polynomial and generating.
Why this record matters
A short description can identify a subject without explaining its stakes. For “Rook polynomial”, the useful work is to connect “generating polynomial of the number of ways to place k non-attacking rooks on a m×n chessboard” to the records capable of establishing context and consequence.
The citation trail is more important than the brevity of the summary: it shows where individual claims can be examined in context. The source revision retrieved here is dated May 27, 2026. The linked authority identifier is Q12594240. None of the 0 selected statements returned an explicit reference.
Overview language is designed for orientation and should not be treated as a substitute for the evidence cited beneath it. The source lead contains qualifying language; that uncertainty should survive quotation, summary and reuse. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Use the entry as an orientation point, then follow its citations and revision history. Names, dates and institutional relationships should be checked against the original record.
- Subject orientation
- Search vocabulary
- Locating named sources
The closest primary source, responsible institution and strongest cited specialist reference.
Three-step research path
- Establish the record: confirm the title “Rook polynomial”, its source revision and the description used here.
- Expand the search: follow Rook polynomial primary sources, Rook polynomial archive and Rook research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Rook polynomial”?
- Which institution is responsible for the underlying evidence?
- What terminology or title could unlock a more precise catalogue search?
Search terms from this dossier
This entry incorporates text from “Rook polynomial” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.