搜索资源列表
queen
- 用回溯法的思想解答 n皇后问题，掌握使用回溯法求解问题的基本思路-The idea with backtracking to answer n queens problem, master the use of backtracking to solve the problem of the basic ideas
wu
- 掌握使用回溯法求解问题的基本思路，用回朔法做n皇后问题-Use backtracking to solve the problem to master the basic ideas, with the retrospective method to do the n queens problem
nprime
- N Prime问题也可以成为N皇后问题，此算法这是回溯法,非递归实现.-N Prime problem can also be N Queens problem, this algorithm is backtracking, non-recursive implementation.
eightqueens
- 回溯法解决八皇后问题，使四个皇后不在同一行，不在同一列，且不在同一对角线上-Backtracking to solve the eight queens problem，Make four Queen s not in the same row, not in the same column, and not in the same diagonal
queen
- 用回溯法解决8皇后问题，用的是vc递归。一个92种解法，希望对大家有用。
NQueue
- 利用回溯法求解N皇后问题及其算法性能分析。-The use of backtracking algorithms for solving N Queens problem and its performance analysis.
suanfa
- 算法结构代码，第五章5-15答案，用回溯法解决并行工作分配问题-Algorithm structure code, chapter V 5-15 answers, working in parallel with the backtracking method to deal with the allocation of
huisufa0-1beibaowenti
- 算法分析与设计中的经典问题，利用回溯法解决背包问题，有详细的代码段。-Algorithm analysis and design of the classic problems, the use of backtracking to solve knapsack problem, there is a detailed code snippet.
beibao
- 算法实验C++编程用回溯法解决01背包问题-Experimental C++ programming algorithm with backtracking to solve 01 backpack
jumphorse
- 解决棋盘的马从第一个位置开始跳经过每个位置，用回溯法解决-To solve the board' s horse began to jump from the first position through each location, using backtracking to solve
a
- 为了方便大家更好的学习算法分析，我上传了一个用回溯法解决的01背包问题-In order to facilitate a better learning algorithm all analysis, I uploaded a backtracking method to deal with the 01 knapsack problem
frame
- 用回溯法解决不是很麻烦的传教士和野人问题-By backtracking to solve is not very troublesome issue of missionaries and Savage
11
- 算法设计报告，有5种算法，动态规划，贪心法，回溯法，递归，分支界限法
2222
- 旅行商问题 实现方法为回溯法 经acm测试通过-无
w
- 子集树回溯法 试设计一个用回溯法搜索子集空间树的函数。该函数的参数包括结点可行性判定函数和上界函数等必要的函数，并将此函数用于解装载问题。 装载问题描述如下：有一批共n个集装箱要装上艘载重量为c的轮船，其中集装箱i的重量为wi。找出一种最优装载方案，将轮船尽可能装满，即在装载体积不受限制的情况下，将尽可能重的集装箱装上轮船。-A subset of the trial design of a backtracking tree with backtracking search a subs
1
- 解数独，采用了回溯法，效率不是很高，但是算法很简洁-Means it alone, using a retrospective method, efficiency is not high, but the algorithm is very simple. . .
01knapsackproblem
- 回溯法解决01背包问题，是在标准C++上运行的代码，故在VC++上也能运行良好！-Backtracking to solve 01 knapsack problem is in the standard C++ code to run on, so the VC++ is also able to run well!
n_queens
- 图形化N后问题回溯解法,用回溯法求N后问题的所有解并以列表方式给出,某个向量解给出其图形化解布局-After the story goes back a graphical solution of N, N using backtracking after seeking all solutions of the problem and in tabular form are given, a vector graphics to resolve the layout of its soluti
Sudoku
- 回溯法生成数独-Backtracking generates Sudoku
HORSE
- 回溯法的马周游问题 回溯法的马周游问题-Backtracking problem horse travel horse travel problems backtracking backtracking horse travel problems