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.
Original language | English |
---|---|
Article number | rmm-2021-0007 |
Pages (from-to) | 1-12 |
Number of pages | 12 |
Journal | Recreational Mathematics Magazine |
Volume | 8 |
Issue number | 15 |
DOIs | |
Publication status | Published - 7 Dec 2021 |
Keywords
- 05C69
- 00A08