MathDB
BMT 2015 Spring - Individual 12

Source:

January 22, 2022
combinatorics

Problem Statement

How many possible arrangements of bishops are there on a 8×88 \times 8 chessboard such that no bishop threatens a square on which another lies and the maximum number of bishops are used? (Note that a bishop threatens any square along a diagonal containing its square.)