2016 OIM Problems/Problem 4

Problem

Find the greatest number of bishops that can be placed on an $8 \times 8$ chess board, so that no two bishops are on the same square and each bishop is threatened at most by one of the other bishops.

Note. A bishop threatens another if both are on two different squares of the same diagonal. The board has as diagonals the two main diagonals and those parallel to them.

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

OIM Problems and Solutions