Chess/Puzzles/Placement/32 Knights/Solution

Here's a possible solution to the puzzle:

Proof of maximality
Pair up the squares of the board, demonstrated by the pairs of chess pieces on the board below.

Continue this pairing onto the rest of the board. On each pair of such squares, only one knight may be located. Since there are 32 such pairs, it's impossible to place more than 32 knights on the board. Since placing 32 knights is possible, 32 is the maximum number of knights that can be placed on a chessboard so no two attack each other.

This solution is only best if we assume the board cannot have other pieces besides knights. Given that no such presumption is stated, by using king pins at least a few more than 32 knights may be placed with none able to legally capture each other. Here is a simple example of a 35 knight solution by adding 11 on-color-kings, 9 off-color-queens, and 3 new knights to the board state in image 1 of this page (though more optimal answers likely exist).

(edit) Wiki won't allow any picture uploads, but surely the advancements are not hard to imagine if you begin with the 32 single color square solutions and from there apply on-color-kings and off-color-queens to secure safe and immobile knight squares to occupy.

The necessity(?) of multiple same-color kings to this method can be argued to its invalidity, but of course, 32 knights––let alone 32 white knights as shown above––is an equally impossible board state given standard starts.