|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
A q-queens problem. VII. Combinatorial types of nonattacking chess riders | | Christopher R.H. Hanusa
; Thomas Zaslavsky
; | | Date: |
21 Jun 2019 | | Abstract: | On a convex polygonal chessboard, the number of combinatorial types of
nonattacking configuration of three identical chess riders with $r$ moves, such
as queens, bishops, or nightriders, equals $r(r^2+3r-1)/3$, as conjectured by
Chaiken, Hanusa, and Zaslavsky (2019). Similarly, for any number of identical
3-move riders the number of combinatorial types is independent of the actual
moves. | | Source: | arXiv, 1906.8981 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER