Bishop Independence on the Surface of a Square Prism-Reference-Cited by-同舟云学术

Bishop Independence on the Surface of a Square Prism

Published:2021-11-01 Issue:15 Volume:8 Page:1-12
ISSN:2182-1976
Container-title:Recreational Mathematics Magazine
language:en
Short-container-title:

Author:

Harris Liam H.¹,Perkins Stephanie¹,Roach Paul A.¹

Affiliation:

1. School of Computing and Mathematics , University of South Wales , Pontypridd , UK .

Abstract

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.

Publisher

Walter de Gruyter GmbH

Subject

General Chemical Engineering

Link

https://www.sciendo.com/pdf/10.2478/rmm-2021-0007

Reference8 articles.

1. [1] Rudolf Berghammer. “Relational Modelling and Solution of Chessboard Problems”. In: de Swart H. (eds) Relational and Algebraic Methods in Computer Science. Vol. 6663. RAMICS. Springer, Berlin, Heidelberg, 2011, pp. 59–71.

2. [2] D Chatham. “Independence and Domination on Shogiboard Graphs”. In: Recreational Mathematics Magazine 4(8) (2018), pp. 25–37.

3. [3] Joe Demaio and William Faust. “Domination and Independence on the Rectangular Torus by Rooks and Bishops”. In: Technical report, Department of Mathematics and Statistics, Kennesaw State University (2009).

4. [4] Liam Harry Harris et al. “Bishop Independence”. In: British Journal of Mathematics and Computer Science 3(4) (2013), pp. 835–843.10.9734/BJMCS/2013/5760

5. [5] A. A. Omran. “Domination and Independence in Cubic Chessboard”. In: Engineering and Technology Journal 35(1 Part (B) Scientific) (2017), pp. 68–75.