NL-NWO 1996 Problem 3

What is the largest number of horses that you can put on a chessboard without there being two horses that can beat each other? a. Describe an arrangement with that maximum number. b. Prove that a larger number is not possible.

(A chessboard consists of $8 \times 8$ spaces and a horse jumps from one field to another field according to the line "two squares vertically and one squared horizontally" or "one square vertically and two squares horizontally")