Lesson 8

Problem. Is this a correct proof?

Let's prove that it is not possible to place more than 32 non-attacking knights on the board. A knight always attacks squares of the opposite color. Therefore, it is advantageous to place knights on all, for example, black squares. There will then be exactly thirty-two knights, and they will not attack each other because they are on squares of the same color. At the same time, all white squares are attacked, so it is not possible to place any additional knight. Therefore, it is not possible to place more than 32 knights.