  Given q non-attacking riders with r moves, the number of combinatorial types
has not been found for r greater than 2 and q greater than 3. This paper aims
to create upper and lower bound functions which can be applied to any q and r,
regardless of size.
