Description: 本程序是用VC++编写的残缺棋盘，这是基于分治的思想，现利用一个数组将对应的残缺棋盘用L型排列好，再调用一个上色子程序将棋盘以图形方式用L型骨牌填充起来-this procedure is used to prepare the VC incomplete chessboard, it is based on the idea of partition, now the use of an array of corresponding deterioration chessboard with L-type with good, then call a subroutine will be illuminated chessboard to graphics mode with L-type domino filled up Platform: |
Size: 52166 |
Author:yancy |
Hits:
Description: 作品：算法设计课程作业
作者：陈兴
学号：J04120010
操作说明：
1、最长公共子序列：
用VC6.0打开文件以后输入一串数字，按“\\”为结束，输出结果。
2、背包问题
用vc6.0打开文件以后按提示操作。
3、残缺棋盘问题
用vc6.0打开文件以后按提示操作。
4、（3.1和3.2还有3.3）
这个是课本82页的作业，基本实现了。其中3.2的算法时间复杂度不是nlogn而是n，nlogn的算法没做出来！
-entries : algorithm design courses operating Author : Bernadette school : J04120010 instructions : 1. Public longest sequences : VC6.0 open the file after importing a bunch of numbers, "\\" to the end, and the output results. 2, knapsack problem with open files after vc6.0 suggested by the operation. 3, incomplete chessboard problems with open files after vc6.0 suggested by the operators. 4, (3.1 and 3.2 have 3.3) This is a textbook 82 operations, the basic reality. 3.2 which time the algorithm complexity is not nlogn but n, nlogn algorithm never come out! Platform: |
Size: 809 |
Author:陈兴 |
Hits:
Description: 君主和殖民者们所成功运用的分而治之策略也可以运用到高效率的计算机算法的设计过程中。本章将首先介绍怎样在算法设计领域应用这一古老的策略，然后将利用这一策略解决如下问题：最小最大问题、矩阵乘法、残缺棋盘、排序、选择和一个计算几何问题——找出二维空间中距离最近的两个点。
本章给出了用来分析分而治之算法复杂性的数学方法，并通过推导最小最大问题和排序问题的复杂性下限来证明分而治-monarchy and colonialists who have successfully used the divide and conquer strategy can also be used in high-efficiency computer algorithm design process. This chapter will begin with an introduction in how the algorithm design of the application of this ancient strategy, and then use this strategy to solve the following problems : minimum biggest problem, matrix multiplication, incomplete chessboard, sorting, selection, and a computational geometry problems-- two-dimensional space to find the nearest two points. This chapter is given to analysis of divide and conquer algorithm complexity of the mathematical methods and derived through the largest and the smallest order of the complexity threshold to prove divide and rule Platform: |
Size: 6144 |
Author:小芝 |
Hits:
Description: 本程序是用VC++编写的残缺棋盘，这是基于分治的思想，现利用一个数组将对应的残缺棋盘用L型排列好，再调用一个上色子程序将棋盘以图形方式用L型骨牌填充起来-this procedure is used to prepare the VC incomplete chessboard, it is based on the idea of partition, now the use of an array of corresponding deterioration chessboard with L-type with good, then call a subroutine will be illuminated chessboard to graphics mode with L-type domino filled up Platform: |
Size: 52224 |
Author:yancy |
Hits:
Description: 作品：算法设计课程作业
作者：陈兴
学号：J04120010
操作说明：
1、最长公共子序列：
用VC6.0打开文件以后输入一串数字，按“\”为结束，输出结果。
2、背包问题
用vc6.0打开文件以后按提示操作。
3、残缺棋盘问题
用vc6.0打开文件以后按提示操作。
4、（3.1和3.2还有3.3）
这个是课本82页的作业，基本实现了。其中3.2的算法时间复杂度不是nlogn而是n，nlogn的算法没做出来！
-entries : algorithm design courses operating Author : Bernadette school : J04120010 instructions : 1. Public longest sequences : VC6.0 open the file after importing a bunch of numbers, "\" to the end, and the output results. 2, knapsack problem with open files after vc6.0 suggested by the operation. 3, incomplete chessboard problems with open files after vc6.0 suggested by the operators. 4, (3.1 and 3.2 have 3.3) This is a textbook 82 operations, the basic reality. 3.2 which time the algorithm complexity is not nlogn but n, nlogn algorithm never come out! Platform: |
Size: 1024 |
Author:陈兴 |
Hits:
Description: 对于残缺棋盘的图形演示，可以演示出是如何放入棋盘的-Defective chessboard graphics for presentations, can be a demonstration of how the board Add the Platform: |
Size: 3674112 |
Author:yatou |
Hits:
Description: 残缺棋盘问题，算法设计中最经典也是最重的问题，希望对学习算法的有所帮助-Incomplete chessboard problem, algorithm design in the most classic and most important question in the hope of learning algorithms help Platform: |
Size: 1024 |
Author:张飞 |
Hits:
Description: 残缺棋盘问题解决方法的mfc界面显示，可以动态定义棋盘大小，具有保存和更新功能！-Incomplete chessboard problem solution mfc interface, it can be dynamically defined board size, with save and update features! Platform: |
Size: 116736 |
Author:vv |
Hits:
Description: 残缺棋盘(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 Platform: |
Size: 1024 |
Author:孙嘉嘉 |
Hits:
Search - Incomplete Chessboard