It's possible to place up to 14 non-attacking bishops on a chessboard.
How can I calculate the number of valid configurations, without writing a program to brute force it?
I've checked Non Attacking Chess Pieces, but it doesn't cover the variation I'm interested in, and a quick Google hasn't yielded useful results.
UPDATE:
Proof that only 14 bishops can be placed:
If we divide the chessboard into diagonals, and we treat diagonal 1 and 15 as the same diagonal, then the maximum number of bishops per diagonal is 1, therefore 14.
Here is an example configuration of 14 bishops to show it's possible:
NOTE: Not a duplicate of this question because I am asking about the number of arrangements of 14 bishops, not the maximum number of bishops on a chess board.
Best Answer
Look at the board and count the number of diagonals one direction let's say negative slope there are 7 white and there are 7 black diagonals. So 14 is definitely the largest possible number. For what I'm going to say to make sense make sure you have your chessboard in standard orientation (white in the bottom right-hand corner). I'm going to use / to mean positive sloped diagonal and \ to mean negative sloped diagonal.
Start with the white diagonal in the upper right hand \ diagonal. You have 2 choices to place a bishop here, but then you have made the choice for the bottom left hand \ diagonal. This eliminates the middle two / diagonals from consideration from the rest. So the 2nd \ diagonal down has two choices and similarly forces the next diagonal up to be the other value. This eliminates the next middle two / diagonals from choices. Continue in this manner until you've eliminated you've chosen a place for all the white bishops there are $2^4$ similarly you'll get $2^4$ independent positions for the black bishops. So you can find $2^8=256$ different configurations.
Note: I believe this is effectively brute force since you can recover every configuration from this algorithm we just count them instead of write them down :)