Bishop independence

Liam Harris, Stephanie Perkins, Paul Roach, Sian-Kathryn Jones

Research output: Contribution to journalArticlepeer-review

93 Downloads (Pure)


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 following topologies: the cylinder, the Möbius strip, the torus, the Klein bottle and the surface of a cube.
Original languageEnglish
Pages (from-to)835 - 843
Number of pages8
JournalBritish journal of mathematics and computer science
Issue number4
Publication statusE-pub ahead of print - 5 Sept 2013


  • graph
  • bishop graph
  • independence
  • bishop independence
  • chess
  • chessboards


Dive into the research topics of 'Bishop independence'. Together they form a unique fingerprint.

Cite this