Remaining chessboard implementation

lyx

[TABLE]
[Tr] [TD] [align = left] The incomplete chessboard is a chessboard with 2 ^ k * 2 ^ k sides, which is just a square disabled. The problem of the incomplete board is to cover a larger incontinence chessboard with four different shapes of tribes, and the triangular plate type 1.1. The requirements are required in this coverage: two triangular panels cannot overlap and the triangular panels cannot cover the incomplete checkered, but must override all other checkered. [/ align] [align = center] [attach] 44 [/ attach] [/ align] [/ align] [align = left] [align = center] Figure 1.1 Triple board type [/ align] [/ Align]
[align = left] This program uses the method of dividing and rule to solve the problem of the incomplete board. This approach can be transformed into a problem with the problem of 2 ^ k * 2 ^ k - lack of chessboards to cover smaller incidental chessboards. 2 ^ k * 2 ^ k board a natural division method is to divide it into 4 2 ^ (k - 1) * 2 ^ (k -1) chessboard. After completing this division, there is only one checkerboard in the four small chessboards (because the original 2 ^ k * 2 ^ k board has only one incomplete checkered). First cover 2 ^ (k - 1) * 2 ^ (k -1) incomplete chessboard including the incomplete checkered checkered checker, then convert the remaining 3 small chessboards into the incontinence chessboard, put a triangle on this 3 On the corner of a small chessboard, the original 2 ^ k * 2 ^ k in the checkerboard is in the upper left corner of 2 ^ (k - 1) * 2 ^ (k -1) chessboard. This segmentation technology can be used to recat 2 ^ k * 2 ^ k-flavored chessboard. When the size of the board is reduced to 1 × 1, the recursive process is terminated. At this point 1x1's checkerboard contains only one square and this is disabled, so there is no need to place triangular panels. This program writes the algorithm of the above points into a recursive function. [/ align] [/ td] [/ TR]
[/ table]

azzzdp

sounds great