On the number of bishop arrangements on an \(n\times n\) chessboard (Q801909): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 12:05, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the number of bishop arrangements on an \(n\times n\) chessboard |
scientific article |
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