棋盘填充程序残缺棋盘的问题是：要求用三格板（triominoes）覆盖残缺棋盘（如图1-2所示）。在此覆盖中，两个三格板不能重叠，三格板不能覆盖残缺方格，但必须覆盖其他所有的方格。在这种限制条件下，所需要的三格板总数为(22k-1)/3。可以验证(22k-1)/3是一个整数。k为0的残缺棋盘很容易被覆盖，因为它没有非残缺的方格，用于覆盖的三格板的数目为0。当k=1时，正好存在3个非残缺的方格，并且这三个方格可用图1-2中的某一方向的三格板来覆盖。-chessboard filled with incomplete procedures chessboard question is : They want the three grid plate (triominoes) chessboard incomplete coverage (as shown in Figure 1-2). In this coverage, two three lattice panels can overlap, three lattice panels not cover defective box, but must cover all other box. In such conditions, the required three the total number of grid plate (22k-1) / 3. Can certification (22k-1) / 3 is an integer. K 0 chessboard of the deterioration can easily be covered, because it does not non-ramshackle box for coverage of the three grid plate number of 0. When k = 1, is the non-existence of three ramshackle box, and this box can be used Figure 3 1-2 in a direction of the three grid plate to cover.