Description: Set B is an n × n chessboard, n = 2k, (k = 1,2,3, ...). With sub-rule method to design an algorithm so that: The number of L-type compartmentalization can live B coverage in addition to a special side of all the extra box. Among them, an L-bar may be covered by three grid. And any two L-bar can not be overlapping coverage chessboard
File list (Check if you may need any files):
Download