Title
A q-queens problem. VII. Combinatorial types of nonattacking chess riders
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 Zaslaysky (2019). Similarly, for any number of identical 3-move riders the number of combinatorial types is independent of the actual moves.
Year
Venue
DocType
2020
AUSTRALASIAN JOURNAL OF COMBINATORICS
Journal
Volume
Issue
ISSN
77
PT 3
2202-3518
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Christopher R. H. Hanusa1276.63
T. Zaslavsky229756.67