文件名称:Incomplete-chessboard
- 所属分类：
- 人工智能/神经网络/遗传算法
- 资源属性：
- [C/C++] [源码]
- 上传时间：
- 2015-06-28
- 文件大小：
- 1kb
- 下载次数：
- 0次
- 提 供 者：
- 孙**
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
残缺棋盘(defective chessboard)是一个有2^k×2^k(k>=1)个方格的棋盘，其中恰有1个方格残缺, 其中残缺的方格用阴影(0)表示。
这样的棋盘称作“三格板”(triominoes)，残缺棋盘问题就是用这4种三格板覆盖更大的残缺棋盘。在覆盖中要求：
两个三格板不能重叠。
三格板不能覆盖残缺方格，但必须覆盖其他所有的方格。
在这种限制条件下，所需要的三格板总数为(2^k×2^k-1)/3-Incomplete chessboard (defective chessboard) is a 2 ^ k × 2 ^ k (k> = 1) squares of the chessboard, which just has a checkered incomplete, which crippled the box is shaded (0).
Such a board is called the three lattice panels (triominoes), incomplete chessboard problem is to use these four kinds of three grid plate to cover a larger chessboard incomplete. In the coverage requirements:
Two three lattice panels can not overlap.
Three incomplete square lattice panels can not cover, but must cover all of the other squares.
In this constraint, the total number of three grid plate is required (2 ^ k × 2 ^ k-1)/3
这样的棋盘称作“三格板”(triominoes)，残缺棋盘问题就是用这4种三格板覆盖更大的残缺棋盘。在覆盖中要求：
两个三格板不能重叠。
三格板不能覆盖残缺方格，但必须覆盖其他所有的方格。
在这种限制条件下，所需要的三格板总数为(2^k×2^k-1)/3-Incomplete chessboard (defective chessboard) is a 2 ^ k × 2 ^ k (k> = 1) squares of the chessboard, which just has a checkered incomplete, which crippled the box is shaded (0).
Such a board is called the three lattice panels (triominoes), incomplete chessboard problem is to use these four kinds of three grid plate to cover a larger chessboard incomplete. In the coverage requirements:
Two three lattice panels can not overlap.
Three incomplete square lattice panels can not cover, but must cover all of the other squares.
In this constraint, the total number of three grid plate is required (2 ^ k × 2 ^ k-1)/3
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Incomplete chessboard.cpp