On the number of bishop arrangements on an \(n\times n\) chessboard (Q801909): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 02:16, 5 March 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
