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 n∗n chessboard is 2n−2. (Two bishops are said to be attacking if they are on a common diagonal). combinatoricsChessboardExtremal combinatorics