本程序生成一个n*n的棋盘，n是2的幂，用一个分治算法，用一个L型条块去覆盖除一个指定方块外的所有方格。

如n=2，则有4个方格，其中3个能被一个L型覆盖，N=4，有16个方格，其中15个方格被5个L条型覆盖。

结果中每一个L条形用3对坐标表示-This procedure generates a n* n chessboard, n is a power of 2, with a divide and conquer algorithm, with an L-slice to a specified coverage in addition to all the square outside the box. If n = 2, there are four squares, of which three can be an L-type coverage, N = 4, there are 16 squares, 15 squares were covered by five L bar. The results of each strip with L 3 on the coordinates