残缺一格棋盘上线型骨牌覆盖问题的研究

Research on the Covering Problem of Linear Dominoes on the One-lattice-incomplete Chessboard

研究了k格线型骨牌在残缺一格的m×n棋盘上的完美覆盖问题,利用轨道循环标号法及分治法,得到了残缺一格棋盘上存在k格线型骨牌完全覆盖的充分必要条件,从而完全解决了线型骨牌在残缺一格棋盘上的覆盖问题.

In this paper,we study the perfect covering problem of k-lattice linear dominoes on the incomplete m x n chessboard.By using the divide and conquer method and the orbit cycle labeling method,we have obtained the sufficient and necessary conditions for the complete coverage of the fc-lattice linear dominoes on the incomplete one-lattice chessboard.Thus,the problem is completely solved.