搜索资源列表
200406251238582470
- 棋盘覆盖问题的算法源程序,是用JAVA实现的，可以运行-chessboard coverage of the algorithm source code, is to use Java to achieve, and can run
实验报告-棋盘覆盖
- 关于棋盘覆盖的基本思想运行结果测试平台以及源码-coverage on the chessboard of the basic ideological operating results and the source test platform
棋盘覆盖算法
- 棋盘覆盖算法~
Chess
- 8*8棋盘覆盖模型。java程序。第一步设置特殊方块坐标，第二步点击覆盖。-8* 8 board cover model. java program. The first step to set a special box coordinates, the second step click coverage.
ChessBoard
- 棋盘覆盖问题,java描述求解算法，算法分析与设计-Board cover problem, java solving algorithm descr iption, algorithm analysis and design
qpfg
- 改程序是描述棋盘覆盖的问题，此方法效率较高，运行较好-Reform program is to describe the problem covered by the board, this method is more efficient and run better
chessbordcover(java)
- java语言，使用分治的思想，解决经典的棋盘覆盖的问题。-broad cover
qipan
- java swing实现的棋盘覆盖 根据分解算法实现-Board covering algorithm
chess
- 棋盘覆盖的java实现代码 -Chessboard coverage of Java implementation code
chess
- 棋盘覆盖，使用此源码可以实现算法分析中的棋盘覆盖问题。-chessBoard
ChessBoardCover
- 经典的算法分析与设计课程中的棋盘覆盖问题，java代码，具有很高的参考价值-Classical algorithm analysis and design course covering the board, java code, with a high reference value
src
- 棋盘覆盖问题，算法分治算法的应用，java完成-Board cover problem, divide and conquer algorithm algorithm application, java complete
Chess
- L型棋盘覆盖，算法设计递归算法，界面动态显示覆盖过程-L型棋盘覆盖，算法设计递归算法，界面动态显示覆盖过程 Allow phonetic typingType text or a website address or translate a document. Cancel L xíng qípán fùgài, suànfǎ shèjì dìguī suànfǎ, jièmiàn dòngtài xiǎnshì fùgài guòchéngEnglishChinese (Simpl
Myframe.class
- 棋盘覆盖（有界面效果）,分治算法，界面还行-Board cover (interface effect), divide and conquer algorithm, the interface line
ChessBoard
- 大学期间的棋盘覆盖算法，采用分治策略，拥有图形界面。-University during the chessboard covering algorithm using a divide-and-conquer strategy, has a graphical interface.
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
The-chessboard-coverage
- 解决经典的棋盘覆盖问题，利用四种情况描述期盼覆盖的问题-The chessboard coverage
teshuqipanfugai
- 特殊棋盘覆盖问题的Java脚本文档,采用递归的思想解决-Special chessboard coverage of Java scr ipt files, using recursive thinking to solve