Bishop independence

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

Research output: Contribution to journalArticlepeer-review

81 Downloads (Pure)

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 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
Volume3
Issue number4
DOIs
Publication statusE-pub ahead of print - 5 Sep 2013

Keywords

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

Fingerprint

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

Cite this