Talk:Chess/Puzzles/Placement/32 Knights/Solution

Is an alternative maximum proof something along the lines of there are 32 white (or black) squares on the board, and that a knight only attacks squares of a different colour?