Description: 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.
To Search:
File list (Check if you may need any files):
Chessboard.java
Download