That is a good high school question.View attachment 256406
High Schoolers only
11. Answer the following questions:
a.) How many knights can you place on a ##n\times m## chessboard such that no two attack each other?
Surely this one is a bit too hard though?b.) In how many different ways can eight queens be placed on a chessboard, such that no queen threatens another? Two solutions are not different, if they can be achieved by a rotation or by mirroring of the board.