Squares on chessboard so that bishop attacks 2 squares.
Source: ToT 2003-JA-4
June 19, 2011
combinatorics unsolvedcombinatorics
Problem Statement
Several squares on a chessboard are marked so that a bishop placed on any square of the board attacks at least two of marked squares. Find the minimal number of marked squares.