搜索资源列表
Backtracking
- 回溯法解决背包问题。经典背包问题的回溯法C语言实现。-Backtracking to solve knapsack problem. Classical knapsack problem backtracking C language.
Queen
- N皇后问题,hopfield,回溯法，人工智能-N-Queen hopfield，huisu
Knight-Parade
- 骑士巡游问题:从国际象棋棋盘上任意给定的方格开始移动骑士，相继地到达所有的64个方格，进入每个方格一次且仅进入一次。回溯法实现-Knight Parade problem: the chess board from any given knight box began to move, have to reach all the 64 squares, each square once and only entered into once. Backtracking to achieve
N_queens
- 求解N皇后问题：把N个皇后放在一个棋盘上，每行和每列只能有一个皇后。另外，一个皇后只能在任一行、列或对角线上。要求皇后数≥100。用了两种方法，回溯法和启发式修补法。-Solve N Queen' s problem: N queens on a chessboard, each row and each column can have only one Queen. Further, only in a queen in any row, column, or diagonal. Que
maze
- 回溯法解决迷宫问题，用TuborC来实现图形界面-Backtracking to solve maze problems, using a graphical interface implemented TuborC
huisufa2
- 在visual c++环境下用回溯法实现对八皇后问题的求解-In visual c++ environment to achieve by backtracking to solve the eight queens problem
nhuanghou
- n皇后问题解法，最典型的是8皇后，用于递归回溯法的经典案例。-n queens solution, the most typical is 8 Queen, for a classic example of a recursive backtracking.
eightqueens
- 算法中的经典问题：八皇后问题，回溯法的重要应用-eightqueens in C language
program-3
- 压缩包包含三个程序 分别是动态规划解奶牛家谱问题，普里姆算法求最小生成树，回溯法解决24点问题-Package contains three programs are the problem of dynamic programming solutions cow family tree, Prim for the Minimum Spanning Tree, backtracking to solve the problem 24 points
huisufa
- 回溯法是一个既带有系统性又带有跳跃性的搜索算法，它在问题的解空间树中按深度优先策略，从根节点出发搜索解空间树。回溯法求问题的所有解时，要回溯到根，且根节点的所有子树都已被搜索遍才结束。回溯法求问题的一个解时，只要搜索到问题的一个解就可以结束。使用回溯法解决n皇后问题时，用完全二叉树表示解空间，用n元组x[1:n]表示，其中x[i]表示皇后i放在棋盘的第i行的第x[i]列，根据规则任何2个皇后不放在同一行或同一列或同一斜线上，则可以得到等式关系，由此可以进行解决问题。-Backtracking
eightQueue
- 用回溯法，求解八皇后问题。该算法是算法设计与分析的一个常用例题的求解-By backtracking to solve the eight queens problem. The algorithm is algorithm design and analysis to solve a common example
01bag
- 实现经典0-1背包问题，采用动态规划、分枝限界、回溯法、贪心算法等四个算法分别实现0-1背包问题，并有一个四合一的算法统一用四种方法实现。并对其时间复杂度进行了分析。-To achieve the classic 0-1 knapsack problem, dynamic programming, branch and bound, backtracking, greedy algorithm to achieve the four algorithms are 0-1 knapsack pro
diannaoshu
- 用回溯法和栈实现电脑鼠走迷宫迷宫程序，完美的C++程序，抱你满意，谢谢访问，您的满意，是我们永远追求的目标 -failed to translate
lxshs
- 旅行售货商问题，利用回溯法完成，内附运行图-Problems for travel sales, the use of backtracking to complete, included diagram
nQueen
- N皇后问题：拉斯维加斯算法和回溯法的结合，可以输出每次搜索的节点数（包括成功的搜索和失败的搜索），以及直到找到一个正确结点的搜索总节点数。-N Queens problem: Las Vegas, the combination of algorithm and backtracking, can output the number of nodes per search (including the failure of successful search and the search), a
zuixiao
- 最小重量机器设计问题，回溯法和分支限定法-#include<iostream> using namespace std #define N 3 #define M 3 int w[N][M]={{1,2,3},{3,2,1},{2,2,2}} int c[N][M]={{1,2,3},{3,2,1},{2,2,2}} class machine {public:
Backtrackingtosolvetheeightqueens
- 回溯法解决八皇后问题，自己编写，如有错误，敬请斧正-Backtracking to solve the eight queens problem, I have written, if an error, please Fu Zheng
dall
- 一个关于利用回溯法求解旅行商问题的源代码，希望对你们有帮助-A retrospective review on the use of the source code for solving traveling salesman problem, want to help you
knapsack(five)
- 实现0-1背包问题的优先队列分支限界算法 FIFO 分支限界算法 递归法 回溯法 动态规划算法-0-1 knapsack problem to achieve the priority queue FIFO branch and bound algorithms branch and bound backtracking algorithm recursion dynamic programming algorithm
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