Problem 3 - Chess

How many knights can you place on a chess board so that none of them are able to attack any of the others? (Knights move in an 'L' shape, two spaces in one direction then one space sideways.) Can you find a nice proof that it is impossible to do more than your number?