Question 40
An $8 \times 8$ chessboard is colored in the usual way. What is the largest number of pieces can be placed on the black squares (at most one per square), so that each piece can be taken by at least one other? A piece $A$ can take another piece $B$ if they are (diagonally) adjacent and the square adjacent to $B$ and opposite to $A$ is empty.