在一个 （k≥0）个方格组成的棋盘中，恰有一个方格与其他方格不同，称该方格为特殊方格。显然，特殊方格在棋盘中可能出现的位置有 种，因而有4k种不同的棋盘，图a所示是k=2时16种棋盘中的一个。棋盘覆盖问题（chess cover problem）要求用图 (b)所示的4种不同形状的L型骨牌覆盖给定棋盘上除特殊方格以外的所有方格，且任何2个L型骨牌不得重叠覆盖。-In a (k = 0) squares which board, just a different box and other boxes, saying that the square is special box. Obviously, the possible special box on the board position in kind, so there are 4K different board, shown in figure a is k=2 16 board in a. Board covering problem (chess cover problem) requirements for graph (b) of 4 different shapes of L type domino coverage shown in box at all except in special box outside the given on the board, and any of the 2 L type domino coverage may not overlap.