搜索资源列表
subSetSum
- 说明:子集和问题 给定一个n个整数的集合X = {x1, x2, …, xn}和整数Y,找出和等于Y的X的子集subX。 比如说,如果X ={10,20,30,40,50,60} 和 Y = 60 则有三种不同长度的解,它们分别是 subY = {10,20,30},{20,40} 和{60} 使用回溯法实现.开发VS2005工具-Descr iption: a subset of the problem and given a set of n integers X = (
Sudu
- 使用MFC写的一个解数独的程序,主要使用了类CNineGong及CCell,原理回溯法测试填入的数字是否合理,做了些优化,速度比以前快许多-Use MFC to write a single procedure itself, the main use of the category CNineGong and CCell, the principle of backtracking fill in the number of tests is reasonable, to do some op
Hamilton
- 利用回溯法求解hamilton回路的算法-Use of backtracking algorithms for solving circuit hamilton
perm
- 利用回溯法求解背包问题和全排列的算法,用c++实现。-The use of retrospective method knapsack problem and the whole array of algorithms, using c++ realize.
EightQueensProblem
- 八皇后问题,回溯法解决。 这可能是一个简单问题。-Eight queen problem, retroactive law. This is probably a simple question.
shudu
- 求解数独问题, 能精确快速求解数独, 是用回溯法求的.-I not sure how to describe it in English,but It a problem about number magic
Jump_Horse
- 一个回溯法做跳马问题的探究,版权所有,下载后请于24小时内删除-A backtracking to do to explore the question vault, all rights reserved, after the download, please delete within 24 hours
example
- 回溯法是一种选优搜索法,按选优条件向前搜索,以达到目标但当探索到某一步时,发现原先选择并不优或达不到目标,就退回一步重新选择。这种走不通就退回再走的技术为回溯法,而满足回溯条件的某个状态的点称为“回溯点”。回溯算法是所有搜索算法中最为基本的一种算法,其采用了一种“走不通就掉头”思想作为其控制结构 -Backtracking is a search optimization method, based on forward selection search terms in order to ac
hd1016.2.0
- 杭电acm 1016 学习回溯法 可以-Acm 1016 Hang electricity can be retrospective study to see
demarkation
- 讲述回溯法的数学原理及在工程中的运用,并用具体matlab程序进行编程-Backtracking on the mathematical theory and application in engineering, and specific procedures matlab programming
KnapsackProblem
- 0/1背包问题的几种解法,包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.
KnightTour
- 用回溯法求解KnightTour问题 【KnightTour问题】在一个8×8的棋盘上,检验以某一位置作为出发点的棋子能否遍历一次棋盘上的所有棋格,且最后回到出发点。(备注:棋子每次只能沿东、南、西、北、东南、西南、东北、西北方向走一步!!)-Method with back issues KnightTour】 【KnightTour issues in a 8 × 8 chessboard, the examination for the position as the startin
maze
- 老鼠走迷宫。。。用回溯法求解。。。。矩阵记载迷宫资料-Maze rats. . . Method with backtracking. . . . Recorded in the maze of information matrix. . . .
eightqueens
- 自己编写的八皇后问题的各种随机算法:包括了随机算法,回溯法,随机+回溯求解八皇后-I have written eight issues of a variety of Queen' s random algorithm: including a random algorithm, backtracking random+ back to solve the eight Queen' s
huisu
- 算法分析中,回溯法经典范例的实现,并有完整的测试数据-Algorithm analysis, the retrospective method of realization of the classic examples, as well as complete test data
n
- 这是n皇后回溯法,可能有点不是很优的,大家拿去多改进-nqueque
Backtrack
- 回溯法解决符号三角形问题 -Backtracking to solve the issue of symbols triangle
huisufa01beibao
- 算法框架: a.. 问题的解空间:应用回溯法解问题时,首先应明确定义问题的解空间。问题的解空间应到少包含问题的一个(最优)解。 b. 回溯法的基本思想:确定了解空间的组织结构后,回溯法就从开始结点(根结点)出发,以深度优先的方式搜索整个解空间。这个开始结点就成为一个活结点,同时也成为当前的扩展结点。在当前的扩展结点处,搜索向纵深方向移至一个新结点。这个新结点就成为一个新的活结点,并成为当前扩展结点。如果在当前的扩展结点处不能再向纵深方向移动,则当前扩展结点就成为死结点。换句话说,
tracking01
- 采用回溯法解决0-1背包问题,验证是否能获得最优解.-Retrospective method used to solve 0-1 knapsack problem, verify whether he can be the optimal solution.
ThreeColor
- 采用回溯法,利用动态搜索树的数据结构来构造一棵解树,实现3着色问题。 本程序使用迭代回溯算法-The use of retrospective law, the use of dynamic search tree data structure to construct a solution tree, the realization of 3 coloring problem. This procedure backtracking algorithm using iterative