Problem #PRU-100635

Problems Methods Algebraic methods Counting in two ways

Problem

An \(8 \times 8\) chessboard has 30 diagonals total (15 in each direction). Is it possible to place several chess pieces on this chessboard in such a way that the total number of pieces on each diagonal would be odd?