B.Math - Bishop
Source:
June 17, 2012
combinatoricsChessboardExtremal combinatorics
Problem Statement
Bishops on a chessboard move along the diagonals ( that is , on lines parallel to the two main diagonals ) . Prove that the maximum number of non-attacking bishops on an chessboard is . (Two bishops are said to be attacking if they are on a common diagonal).