搜索资源列表
ChessBoard
- 算法分析与设计中用分治法解决棋盘覆盖问题。-Algorithm Analysis and Design using divide and conquer to solve the problem the board cover.
ChessBoard
- 完美的棋盘覆盖程序，界面很漂亮！！可以自动覆盖，也可以手动单步执行，自动覆盖可以自己设定覆盖间隔。-Perfect board cover procedures, the interface is very beautiful! ! Automatically covered, or you can manually step by step, auto coverage interval can be set for cover.
ChessBoard.java.Advanced.Code
- ChessBoard.java高级开发代码ChessBoard.java Advanced Development Code -ChessBoard.java Advanced Development Code
Chessboard
- 本程序生成一个n*n的棋盘，n是2的幂，用一个分治算法，用一个L型条块去覆盖除一个指定方块外的所有方格。 如n=2，则有4个方格，其中3个能被一个L型覆盖，N=4，有16个方格，其中15个方格被5个L条型覆盖。 结果中每一个L条形用3对坐标表示-This procedure generates a n* n chessboard, n is a power of 2, with a divide and conquer algorithm, with an L-slice to a sp
chessboard
- Construct a regular pattern (chessboard) by giving the width and height of the chessboard and of the square inside of it.
defective-chessboard-
- 用c++编的残缺棋盘程序，同学的，用来交流一下。-C++ compiled with incomplete chessboard program, students, to exchange it.
chessBoard
- 实现图形化的棋盘覆盖问题。用VC++实现的一个小程序。-Implement graphical chessboard coverage problems.
ChessBoard
- VC++实现的算法分析上的棋盘覆盖程序 喜欢Windows编程的朋友可以下载-VC++ ChessBoard
chessboard-distance
- 一道poj上的问题的解答，棋盘上的距离问题。即实现棋盘上从一个点移动到王，后，兵之间最短步数的解答。-A poj answers to your questions on the chessboard distance problem. That is, move from one point to the king on the board, after the shortest number of steps between the soldiers answer.
ChessBoard
- 大学期间的棋盘覆盖算法，采用分治策略，拥有图形界面。-University during the chessboard covering algorithm using a divide-and-conquer strategy, has a graphical interface.
ChessBoard
- 算法设计中的棋盘覆盖 输出覆盖后的矩阵-The chessboard coverage algorithm design output coverage matrix
The-chessboard-coverage
- 解决经典的棋盘覆盖问题，利用四种情况描述期盼覆盖的问题-The chessboard coverage
ChessBoard
- 有个一特殊方格的棋盘覆盖问题,可以用4种不同形态的L型骨牌覆盖棋盘。-There is a special box at the chessboard coverage problem, you can use four different forms of L-type domino cover board.
chessBoard
- 棋盘覆盖问题：在一个2^k*2^k个方格组成的棋盘中用4种不同形态的L型骨牌覆盖一个给定的特殊棋盘上除特殊方格以外的所有方格，且任何2个L型骨牌不得重叠覆盖-Board cover: a chessboard 2 ^ k* 2 ^ k squares composed using four kinds of different forms of an L-type domino covering all given special squares on the board except for
chessboard-coverage-of-c-code
- 利用分治策略对棋盘覆盖问题进行求解，用c语言来实现。-Using divide and conquer strategy chessboard coverage of c code
chessboard
- this is opengl code to show chessboard.
Chessboard-coverage
- 在一个2k x 2k ( 即：2^k x 2^k )个方格组成的棋盘中，恰有一个方格与其他方格不同，称该方格为一特殊方格，且称该棋盘为一特殊棋在棋盘覆盖问题中，要用4种不同形态的L型骨牌覆盖给定的特殊棋盘上除特殊方格以外的所有方格，且任何2个L型骨牌不得重叠覆盖。-Chessboard coverage
defective-chessboard-
- 用c++编的残缺棋盘程序，同学的，用来交流一下。-C++ compiled with incomplete chessboard program, students, to exchange it.
defective-chessboard-
- 用c++编的残缺棋盘程序，同学的，用来交流一下。-C++ compiled with incomplete chessboard program, students, to exchange it.
Incomplete-chessboard
- 残缺棋盘(defective chessboard)是一个有2^k×2^k(k>=1)个方格的棋盘，其中恰有1个方格残缺, 其中残缺的方格用阴影(0)表示。 这样的棋盘称作“三格板”(triominoes)，残缺棋盘问题就是用这4种三格板覆盖更大的残缺棋盘。在覆盖中要求： 两个三格板不能重叠。 三格板不能覆盖残缺方格，但必须覆盖其他所有的方格。 在这种限制条件下，所需要的三格板总数为(2^k×2^k-1)/3-Incomplete chessboard (defect