搜索资源列表
backtraing
- *零件切割问题: *给定一块宽度为W的矩形板,矩形板的高度不受限制。现需要从板上分别切割 *出n个高度为hi,宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形 *板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小? *使用回溯算法实现程序。 *编译方法:打开cpp文件,在编译的同时建立工程,打开 "settings->link" *在link项的Object/library modules
fivestones(v1.0.0)
- 电脑下子时先检查未落子点的权值,在权值最高的位置下棋。如果要提高人工智能,可用探索回溯的方法多搜索几步,在比较那点权值最高。 检查m,n点的权值的方法: -Computer to check under the midnight未落the right to sub-point value, the highest value in the right location of a game of chess. If you wa
QueenLV
- 概率算法和回溯法结合,达到总体时间最优。-Probabilistic algorithms and backtracking combination to achieve optimal overall time.
migongsuanfa
- 迷宫算法,一个利用堆栈和回溯算法实现的自动寻路程序-Maze algorithm, a use of the stack and backtracking algorithm to achieve automatic routing procedures
backtrack_1
- 回溯算法的应用 给定一块宽度为W的矩形板,矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi,宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小?-Backtracking algorithm for the application of a given width W of a rectangular plate, rectangular plate of
migong
- 通过回溯算法完成对迷宫路口的选择 找出出路 包含了对循环路径的求解-Through backtracking algorithm to complete the maze to find the way out the choice of the junction contains a cycle path to solve
basicAlgorithm(pascal)
- 基本算法正稿 包括:一、数论算法;二、图论算法;三、背包问题;四、排序算法;五、高精度计算;六、 树的遍历;七 进制转换;八 全排列与组合的生成;九.查找算法;十、贪心;十一、回溯法框架;十二、DFS框架;十三、BFS框架;十五、数据结构相关算法 -Following is the basic algorithm include: number theory algorithm Second, graph theory alg
kmp_suanfa
- KMP模式匹配算法,实现了用KMP算法无回溯查找字符串的功能-KMP pattern matching algorithm using the KMP algorithm without backtracking to find string function
pack
- 背包问题的回溯法,用回溯法解决背包问题,区别于其他算法 -Knapsack Problem retrospective method, with backtracking to solve knapsack problem, different from the other algorithms
huisu
- 回溯法实现多个经典算法,其中包含多种 不同算法哦-Multiple classic backtracking algorithm, which includes a variety of different algorithms Oh
she
- 矩阵连乘问题(备忘录法) 效率不错是用回溯法实现的-Matrix even take questions (Memorandum of Law) is a good efficiency of realization of backtracking
Maze
- 如题 回溯法—迷宫问题 仅供参考。。谢谢大家共同讨论-If the title of backtracking- maze problem is for reference only. . Thank you to discuss
Back_Track
- 使用回溯法解决背包问题,人工智能课程实验课题。-The use of backtracking to solve knapsack problem, artificial intelligence courses experimental subjects.
zuidatuan
- 这个 是 关于 一个 回溯法 做 的 最 大 团问题-This is backtracking on a mission to do the biggest problem
minimumweightdesign
- 计算机算法上最小重量机的回溯法和分支限界法的实现-Computer algorithm on the minimum weight machine backtracking and branch and bound method to achieve
sf
- 算法设计有贪心法,回溯法,动态规划等 算法设计有贪心法,回溯法,动态规划等-Algorithm design are greedy method, backtracking, dynamic programming algorithm design, such as greedy method, backtracking, dynamic programming, etc.
Queen
- n皇后问题的C语言实现,有图形界面的,非常之经典的程序,用的是回溯法-n s C language issues, there are graphical interface, and very classic procedure, using a backtracking
NQueenTree
- 用回溯法解决N皇后问题,并用树来显示整个问题的状态空间-Using backtracking to solve N Queen s problem and used the tree to display the whole issue of state-space
Queue
- 八皇后问题是一个古老而著名的问题,是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出:在8X8格的国际象棋上摆放八个皇后,使其不能互相攻击,即任意两个皇后都不能处于同一行、同一列或同一斜线上,问有多少种摆法。-8 Queen s problem is an ancient and well-known problems, backtracking algorithm is a typical example. The
Nqueen_Backtracking
- N queen Backtracking 算法 N皇后问题的的回溯实现算法-N queen Backtracking Algorithm N Queen s problem of the realization of the backtracking algorithm