It is easy to place 7 chess knights on a 3x3 board. But it becomes a
little bit different when there is a rule to move the knight after you
place it on the board, don't you say?
Development of the chess queen theme. This time it's in the little shift
that no queen can attack another - simply let 'em live in peace on a small
chessboard.
A minimax problem: find the maximum and the minimum number of attacked
vacant cells of a standard chessboard when there are only two chess queens
on it.
Is it possible to place three chess queens on a single non-standard board
so that all vacant cells are attacked? How many ways to do this can you
find?
Make a knight's tour on a small chess board visiting every cell only once
and then returning to the initial cell. You may start from any cell of the
board.
