Non-attacking Bishop and King positions on regular and cylindrical chessboards
J. Integer Seq. 20(6), Article 17.6.1, 26 p. (2017)
Summary
Summary: In this paper, we count the number of non-attacking bishop and king positions on the regular and cylindrical $m \times n (where m = 1, 2, 3)$ chessboards. This is accomplished through the use of scientific computing, recurrence relations, generating functions and closed-form formulas.