A

David

Darling

bishops problem

chess bishop

The bishops problem is to find the maximum number of bishops (pieces capable of moving any number of spaces along diagonals of their own color) that can be placed on an n × n chessboard in such a way that no two are attacking each other. The answer is 2n - 2, which gives the solution 14 for a standard (8 × 8) chessboard. The numbers of distinct maximal arrangements for n = 1, 2, ... bishops are 1, 4, 26, 260, 3368, ...