Introduction - If you have any usage issues, please Google them yourself
Board covering the establishment of a n* n chessboard, n = 2k, with the L-slice coverage for a specified board, in addition to all the extra square grid, each slice can be exactly covered by L-3 grid. Experiment: Design of the board covering the partition algorithm to require graphic.