Bounds for Combinatorial Types of Non-Attacking Riders
Combinatorics
2020-06-25 v2
Abstract
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.
Cite
@article{arxiv.2006.12689,
title = {Bounds for Combinatorial Types of Non-Attacking Riders},
author = {Grant Jensen},
journal= {arXiv preprint arXiv:2006.12689},
year = {2020}
}
Comments
Fixed typos