Bishop Independence on the Surface of a Square Prism
Open Access
- 1 November 2021
- journal article
- research article
- Published by Walter de Gruyter GmbH in Recreational Mathematics Magazine
- Vol. 8 (15) , 1-12
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.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Perfect Domination for Bishops, Kings and Rooks Graphs On Square ChessboardAnnals of Pure and Applied Mathematics, 2018
- Independence and domination on shogiboard graphsRecreational Mathematics Magazine, 2017
- Domination and Independence on Square ChessboardEngineering and Technology Journal, 2017
- Bishop IndependenceBritish Journal of Mathematics & Computer Science, 2013
- Relational Modelling and Solution of Chessboard ProblemsLecture Notes in Computer Science, 2011