You have a rectangular n by n chessboard with a square removed. Assume n is a power of 2. You want to tile it with dominoes such that the dominoes do not overlap, and they tile the board completely. Each domino is L-shaped and covers 3 squares. Give an algorithm to tile the chessboard with these dominoes.