I recently looked into some of these problems and found out they are so amazing.
If a chessboard were to have wheat placed upon each square, such that one grain were placed on the first square, two on the second, four on the third, and so on (doubling the number of grains on each subsequent square), how many grains of wheat would be on the chessboard at the finish?
A and B alternately put white and black knights on the squares of a chessboard, which are unoccupied. In addition, a knight may not be placed on a square threatened by an enemy knight (of the other color). The loser, is the one who cannot move any more. Who wins?
Can anyone suggest to me more such chessboard problems?