# Let's Play Some Chess-2

**Discrete Mathematics**Level 4

A knight attacks another knight if it can be reached by the first knight either by moving it two squares horizontally and then moving one square vertically or by moving it two squares vertically and then moving one square horizontally.

What is the maximum number of knights that can be placed on a chess board such that no knight is attacked by any other knight?

Also try other problems of the set Let's play some chess.