17 citations · 60 across the 22 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
A q-queens problem. VII. Combinatorial types of nonattacking chess riders
Christopher R. H. Hanusa, Thomas Zaslavsky
On a convex polygonal chessboard, the number of combinatorial types of nonattacking configuration of three identical chess riders with moves, such as queens, bishops, or nightr…
math.CO2019
A billiards-like dynamical system for attacking chess pieces
Christopher R. H. Hanusa, Arvind V. Mahankali
We apply a one-dimensional discrete dynamical system originally considered by Arnol'd reminiscent of mathematical billiards to the study of two-move riders, a type of fairy chess p…