Chess piece called skew knight, if placed on the black square, attacks all the gray squares. What is the largest number of such knights that can be placed on the $8\times 8$ chessboard without them attacking each other? Proposed by Arsenii Nikolaiev
Source: Kyiv City MO 2021 Round 1, Problem 11.2
Tags: combinatorics, Chessboard
Chess piece called skew knight, if placed on the black square, attacks all the gray squares. What is the largest number of such knights that can be placed on the $8\times 8$ chessboard without them attacking each other? Proposed by Arsenii Nikolaiev