搜索资源列表
Nqueen
- 8皇后一直是C语言中的经典问题，本代码利用回溯法解决了N皇后问题-8 Queen has been a classic problem in the C language, the code uses backtracking to solve the N queens problem
3
- 试设计一个用回溯法搜索排列空间树的函数。该函数的参数包括结点可行性判定函数和上界函数等必要的函数，并将此函数用于解圆排列问题。 圆排列问题描述如下：给定n 个大小不等的圆c1 , c2 ,..., cn ，现要将这n 个圆排进一个矩形框中，且要求各圆与矩形框的底边相切。圆排列问题要求从n 个圆的所有排列中找出有最小长度的圆排列。例如，当n=3，且所给的3 个圆的半径分别为1，1，2 时，这3 个圆的最小长度的圆排列是1,2,1，其最小长度为2 + 4*sqr(2)。 编程任务：
1
- 用回溯法解决0-1背包问题，用回溯法解决0-1背包问题-用回溯法解决0-1背包问题
bigTuan
- 算法分析与设计 最大团问题 G的最大团是指G中所含顶点数最多的团。 无向图的最大团和最大独立集问题都可以看作是图G的顶点集V的 子集选取问题可以用回溯法在O(n*(2^n))时间内解决。-Algorithm analysis and design problem G, the biggest group the biggest group is the maximum number of vertices of G contained in the group. Undirect
Backtracking
- 这是算法设计与分析课程实验，回溯算法实验的简单的源代码，包括回溯法背包问题，回溯符号问题。-This is the algorithm design and analysis course experiment, the experiment simple backtracking algorithm source code, including backtracking knapsack problem, the problem back symbol.
Queen
- 八皇后回溯法的MFC实现，有界面输出结果，共92种算法-8 queens back law, have the interface to realize MFC output, 92 kinds of algorithms
java_n_queen
- 使用java语言， 回溯法实现n后问题和0－1背包问题-java huisu suanfa slove N Queen question
TheMaxClique
- 算法实习，回溯法解最大团问题，MFC做的界面。-Algorithm practice, backtracking solve the maximum clique problem, MFC to do the interface.
bag3
- 背包问题是很经典的问题，可以使用多种方法解决，这里使用回溯法解决。-Knapsack problem is a classic problem, you can use a variety of methods to solve, backtracking is used here to solve.
Backtracking
- 利用回溯法来求解凸函数的最优值。采用非精确线性搜索，利用最少的迭代次数找到最优值。-backtracking method，change the step size in searching procesure and finally find the optimizaiton points.
Depth-first-search
- 深度优先搜索的搜索过程类似树的先序遍历，也叫回溯法。-Depth-first search of the search process similar to the preorder traversal of the tree, also known as backtracking.
Ai
- 包括人工智能n皇后遗传法、回溯法、爬山法；罗马尼亚度假问题宽度优先、深度优先、贪婪算法、A*算法的实习报告。-N queen genetic methods, including artificial intelligence, backtracking, hill-climbing Romania vacation problem breadth-first, depth-first, greedy algorithm, A* algorithm internship report.
SUDOKU
- 九宫格的数独问题，利用回溯法来求解，C#语言，包括：初始化及填数的步骤-Jiugongge Sudoku problem to solve using backtracking, C# language, including: the number of steps to initialize and fill
Knight-to-travel-around
- 骑士周游问题，用回溯法计算~希望对大家有帮助~-Knights tour problem with backtracking method ~
Computer-algorithms
- 计算机常用的算法，有 算法概述 分治与递归 动态规划 贪心算法 回溯法 分限界法-Computer algorithm used have an overview of divide and conquer algorithm is recursive dynamic programming, greedy algorithms with backtracking points and bound
loading
- 利用回溯法，对两船的装载问题进行计算，当能够装载时，则输出最优解，否则输出无法装载-Use of backtracking on the issue of calculation of loading two ships, when to load, then output the optimal solution, otherwise the output is not loaded
N-QUENE
- 算法在前N/2个位置，利用随机算法求解，得到一个可能的排列之后，利用回溯法求解后面的布局，-Algorithm is the first N/2 positions, using a random algorithm to get a possible arrangement, the use of backtracking to solve the back of the layout,
Ex4-3
- 回溯法实现的青蛙换位问题，具体的问题可以参考网上的讲解。-Backtracking to achieve the frog transposition issues, specific problems can refer to online explanations.
Waterman
- 水人算法，也就是有名的waterman算法，运用回溯法来计算一个二维矩阵的最优路径-Water were algorithm, which is well-known waterman algorithm, using backtracking to calculate the optimal path to a two-dimensional matrix
queen
- 解决经典八皇后问题，利用了回溯法进行计算。文件中包含一个.class文件-Solve the classic 8 queens problems