Find the maximum number of bishops that we can place in an \(8\times8\) chessboard in such a way that each bishops threatens at most 3 other bishops.
(Every bishops threatens other pieces in diagonal directions, and if a piece is placed between two bishops, the bishops will not threaten each other anymore.)
