Lesson 6

As we have already seen, it is possible to place eight non-attacking queens, thirty-two non-attacking knights, or fourteen non-attacking bishops on a chessboard. Think about how to mathematically rigorously prove that it is not possible to place more pieces.

In other words, we want to prove that there do not exist such arrangements:

• nine non-attacking queens;


• fifteen non-attacking bishops;


• thirty-three non-attacking knights.