搜索资源列表
chess
- 实现棋盘覆盖的功能，是基于C的棋盘算法代码，可以-Board covering the function, the board of C-based algorithm code, you can see
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
Cover
- （棋盘覆盖）在一个2^k×2^k （k≥0）个方格组成的棋盘中，恰有一个方格与其他方格不同，称该方格为特殊方格。棋盘覆盖问题要求用图（b）所示的4种不同形状的L型骨牌覆盖给定棋盘上除特殊方格以外的所有方格，且任何2个L型骨牌不得重叠覆盖。 -(board cover) in a ^ 2 k x 2 ^ k (k zero) of a grid board, just have a grid and other grid is different, says the grid for specia
Qipan
- 特殊方格必位于4个较小子棋盘之一中,其余3个子棋盘无特殊方格 用分治法解决棋盘覆盖问题算法接单明了。-Special grid must be located in one of the four smaller sub-chessboard, the remaining three sub-chessboard squares divide-and-conquer method to solve the chessboard coverage problem algorithm orders
qipanfugai
- 棋盘覆盖的算法实现，主要使用递归，二分法实现，对算法的学习很有帮助-The chessboard coverage algorithm mainly use recursive dichotomy achieve, helpful learning algorithm
1-2
- 经典棋盘覆盖问题 c语言版本的 里面有详细的代码-C language version of classic board cover problem which has detailed code
The-chessboard-coverage
- 解决经典的棋盘覆盖问题，利用四种情况描述期盼覆盖的问题-The chessboard coverage
ChessBoardCoverage
- C#实现的棋盘覆盖程序，界面比较漂亮，绝对可以运行！-C# implementation the chessboard coverage program, the interface is beautiful, absolutely can run!
chessBoard
- 棋盘覆盖算法源码 上课时用的 老师布置的作业-The board cover algorithm source class teacher assignments
ChessCover
- 棋盘覆盖可视化mfc 实现可视化 图形化显示-Board cover visualization
ChessBoard
- 王晓东 计算机算法设计与分析 棋盘覆盖问题-chess board
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-coverage
- 算法设计与分析之棋盘覆盖问题的解答 有需要的朋友可以看一下-And checkerboard analysis algorithm designed to answer questions covering a friend in need can look
The-chessboard-coverage
- 本代码实现的是棋盘覆盖问题的解决，棋盘覆盖问题是经典的算法问题。-This code is to solve the problem of covering board, board covering problem is a classical algorithm.
ChessBoard_01
- 棋盘覆盖，使用C#GDI+图形显示覆盖效果。-Chessboard coverage, the use of C# GDI+ graphics coverage.
teshuqipanfugai
- 特殊棋盘覆盖问题的Java脚本文档,采用递归的思想解决-Special chessboard coverage of Java scr ipt files, using recursive thinking to solve
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
2.9ChessBoard
- 在一个2k x 2k ( 即：2^k x 2^k )个方格组成的棋盘中，恰有一个方格与其他方格不同，称该方格为一特殊方格，且称该棋盘为一特殊棋盘。在棋盘覆盖问题中，要用图示的4种不同形态的L型骨牌覆盖给定的特殊棋盘上除特殊方格以外的所有方格，且任何2个L型骨牌不得重叠覆盖-In a 2k x 2k (ie: 2 ^ kx 2 ^ k) consisting of checkerboard squares, and a box with the other box, saying that the
chessboard-coverage-of-c-code
- 利用分治策略对棋盘覆盖问题进行求解，用c语言来实现。-Using divide and conquer strategy chessboard coverage of c code