  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.
