Find the maximum number of bishops B(n) that can be placed on an n×n chessboard such that no two attack each other. The answer is 2n - 2, giving the sequence 2, 4, 6, 8, ... (the even numbers) for n = 2, 3, .... One maximal solution for n = 8 is illustrated above. The numbers of distinct maximal arrangements for n = 1, 2, ... bishops are 1, 4, 26, 260, 3368, ... (OEIS A002465). The numbers of rotationally and reflectively distinct solutions on an n×n board for n>=2 is B(n) = {2^((n - 4)/2)[2^((n - 2)/2) + 1] | for n even 2^((n - 3)/2)[2^((n - 3)/2) + 1] | for n odd auto right match

bishop graph | chess | kings problem | knights problem | queens problem | rooks problem