Source: Futility Closet
Each square on a chessboard contains an arrow point up, down, left or right. You start in the bottom left square. Every second you move one square in the direction shown by the arrow in your square. Just after you move, the arrow on the square you moved from rotates 90° clockwise. If an arrow would take you off the edge of the board, you stay in that square (the arrow will still rotate).
You win the game if you reach the top right square of the chessboard. Can I design a starting arrangement of arrows that will prevent you from winning?
The mutilated chessboard
You are given a chessboard where two diagonally opposite corners have been removed and a large bag of dominoes of such size that they exactly cover two adjacent squares on the chessboard.
Is it possible to place 31 dominoes on the chessboard so that all the squares are covered? If yes, how? If no, why not?
It was once claimed that there are 204 squares on a chessboard. Can you justify this claim?