The algorithm of divide and conquer----board coverage problem

Problem description

In a chessboard of 2^kx2^k squares, a square is different from the other squares, calling it a special square and calling the chessboard a special chessboard. In the problem of board coverage, the 4 different forms of the L-shaped dominoes are used to cover all squares on a given special chessboard except for special squares, and any 2 L-type dominoes must not overlap.

The algorithm of divide and conquer----board coverage problem