In this paper, we count the number of non-attacking bishop and king positions on the regular and cylindrical m × n (where m = 1, 2, 3) chessboards. This is accomplished through the use of scientific computing, recurrence relations, generating functions and closed-form formulas.