On the number of bishop arrangements on an \(n\times n\) chessboard (Q801909)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of bishop arrangements on an n n chessboard |
scientific article; zbMATH DE number 3880707
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of bishop arrangements on an \(n\times n\) chessboard |
scientific article; zbMATH DE number 3880707 |
Statements
On the number of bishop arrangements on an \(n\times n\) chessboard (English)
0 references
1984
0 references
Es wird eine explizite Lösung des folgenden Problems gegeben: Auf wie viele Arten kann man \(k\) Läufer auf einem \(n\times n\)-Schachbrett so verteilen, daß sie sich gegenseitig nicht schlagen?
0 references
rook polynomials
0 references
number of bishop arrangements
0 references
\(n\times n\) chessboard
0 references
