搜索资源列表
MazeSolutions
- c#写的回溯法求解迷宫问题，利用栈来存储方向信息，按原方向回溯-c# write backtracking to solve the maze problem, the direction of the information stored in the stack to the original direction backtracking
queens
- 八皇后问题：回溯法+递归法+排列法+位运算法-Eight queens problem: backtracking+ the recursive method+ permutation+ bit algorithm
Backtracking
- 回溯法，根据解空间树的结构，判断出结果集，不足之处还请指出-Backtracking, according to the tree structure of the solution space, determine the result set, inadequacies also please indicate
code
- 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to so
N-Queen-pashanfa-huisufa
- N皇后问题回溯法爬山算法的实现及性能分析-N Queen
BackTrack
- 回溯法的实现源码，详细介绍了回溯法的使用方式和特点-Backtracking realize the source, detailing the use backtracking and characteristics
0-1-Knapsack-problem
- 本次实验选择0-1背包问题作为题目，通过使用动态规划、回溯法和分支定界法等算法来求解该问题，从而进一步的了解各种算法的原理、思路及其本质，深化对算法的了解，锻炼自己对各种算法的分析和使用，熟悉软件底层算法和界面编程。-The 0-1 knapsack problem was chosen as the subject, through the use of dynamic programming, backtracking and branch and bound method algorit
TSP
- 旅行商问题（Traveling Saleman Problem，TSP）又译为旅行推销员问题、货郎担问题，简称为TSP问题，是最基本的路线问题，该问题是在寻求单一旅行者由起点出发，通过所有给定的需求点之后，最后再回到原点的最小路径成本。采用回溯法，邻点法实现，有图形界面。-TSP (Traveling Saleman Problem, TSP) also translated as traveling salesman problem, traveling salesman problem, r
KnightMove
- 对于骑士走步问题的回溯法实现，具体的问题描述可以上网查询，此处主要给出具体的实现代码，如有不便敬请谅解-For backtracking method to realize the knight move problems, specific problem descr iption can go online inquiry, the main specific implementation code, if there is any inconvenience locations
algorithm
- 关于常用的几种算法介绍1、单源最短路径；2、递归与分治；3、贪心算法；4、动态规划；5、回溯法；6、分支限界法-On several commonly used algorithm introduced a single-source shortest path 2, recursion and divide and conquer 3, the greedy algorithm 4, dynamic programming 5, backtracking 6, branch and
huisufa
- 把长度为l1,l2…ln 的n个程序放在磁带T1和T2上，并且希望按照使用最大检索时间取得最小值的方式存储，即如果存放在T1和T2上的程序集合分别为A和B，则希望所选择的A和B使得max{∑li 1,∑li2}(i1属于A，i2属于B)取得最小。 使用回溯法实现。-The length l1, l2 ... ln n programs on the tape T1 and T2, and want to use the maximum search time in accordance wi
Assignment6-vs2008
- 迷宫问题，用回溯法解决迷宫问题，很有意思的，简单易懂-Maze and solve maze problems with backtracking, very interesting, easy to understand
Ba1
- 回溯法实现八皇后，基于MFCD的对话框程序！-Backtracking to achieve the eight queens, the dialog box procedure based MFCD' s!
chapter-5
- 算法设计与分析 第5章 回溯法（讲解比较详细）-Algorithm Design and Analysis Chapter 5 backtracking (explain in more detail)
huishu
- ACM入门级资料，回溯法的一些比较好的参考论文，供大家参考。-ACM entry-level information, backtracking some good reference paper for reference.
nQueen
- 用回溯法解决n皇后问的的cpp解决方案-n Queens question
shortest-route-problem
- 最短路径问题的四种实现方式:广度优先、深度优先、贪心法、动态规划法、穷举法、回溯法。-Four ways to achieve the shortest path problem breadth priority greedy depth-first dynamic programming method exhaustive backtracking
back
- c 回溯法解决迷宫问题，C语言程序，txt文件含代码。-backtracking for maze problem
queen
- N皇后问题是算法中回溯法应用的一个经典案例 回溯算法也叫试探法，它是一种系统地搜索问题的解的方法。回溯算法的基本思想是：从一条路往前走，能进则进，不能进则退回来，换一条路再试。 -N queens problem is backtracking algorithm applied a classic case of backtracking algorithm, also called heuristics, which is a systematic method for solvi
Queens
- 八皇后,回溯法,JAVA实现,1维数组,可列出所有可行解-Eight Queens, backtracking, JAVA implementation, one-dimensional arrays, lists all feasible solutions