Find the largest possible number of bishops that can be placed on the 8×8 chessboard so that no two bishops threaten each other.