MathDB

On a

10 \times 10

chessboard, several knights are placed, and in any

2 \times 2

square there is at least one knight. What is the smallest number of cells these knights can threat? (The knight does not threat the square on which it stands, but it does threat the squares on which other knights are standing.)

1

Problems(1)