Bishop Independence on the Surface of a Square Prism
Combinatorics
2020-06-30 v1
Abstract
Bishop independence concerns determining the maximum number of bishops that can be placed on a board such that no bishop can attack any other bishop. This paper presents the solution to the bishop independence problem, determining the bishop independence number, for all sizes of boards on the surface of a square prism.
Cite
@article{arxiv.2006.16014,
title = {Bishop Independence on the Surface of a Square Prism},
author = {Liam H. Harris and Stephanie Perkins and Paul A. Roach},
journal= {arXiv preprint arXiv:2006.16014},
year = {2020}
}
Comments
10 pages, 6 figures