搜索资源列表
Nqueensprobleseekingbackrackingalgorith
- n皇后问题回溯算法，用C语言编写的！希望对大家有所帮助！-n queens problem backtracking algorithm, written using C language! We want to help!
Sudo
- 一个数独游戏的计算小程序.利用回溯算法.能算出所有可能的结果.-The calculation of a Sudoku applet. The use of backtracking algorithms. Is able to calculate all the possible outcomes.
mine1.1
- vs2008C#采用回溯算法实现扫雷游戏，-Minesweeper game with backtracking algorithms
WorkAssignment
- 算法设计与分析中，用回溯法解决工作分配问题，有较详细的源码解析。-Algorithm design and analysis, the distribution of work by backtracking to solve the problem, there is a more detailed source code analysis.
wtsf.tgz
- N皇后问题回溯算法.c 货郎担分枝限界图形演示.c 矩阵乘法动态规划.c 万年历 动态计算网络最长最短路线.c 货郎担限界算法.c 骑士遍历 网络最短路径Dijkstra算法.c-N queens problem backtracking algorithm. C TSP branch and bound graphical presentation. C matrix multiplication, dynamic programming. C calendar dynamic compu
maze
- 用c++实现的迷宫程序，采用回溯算法实现。-a maze program done with C++.
backtracking-algorithm-C
- 这是求解VRP和TSP相关问题的回溯算法，基于C语言环境-This is a VRP and TSP solving issues related to backtracking algorithm, based on C language environment
nQueen
- n皇后的回溯算法实现及多边形求和的动归实现。-n Queen backtracking algorithm and the sum of dynamic polygon return achieved.
huisup
- 我的回溯算法学习资料，里边包含n皇后、骑士游历等pascal源程序。-My backtracking algorithm for learning materials, inside contains the n queen, knights traveled so pascal source.
beibaowenti
- 算法实验C++编程用回溯法解决01背包问题-Experimental C++ programming algorithm with backtracking to solve 01 backpack
knight
- 骑士漫游的改进算法，回溯算法加贪心选择策略，n最大可以到128-Knight improved roaming algorithms, backtracking algorithms greedy selection strategy increases, n the greatest can go to 128
eight_queen
- 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出:在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法-Eight queens problem is an old and well-known problem is a typical Example backtracking algorithms. The problem is that the nineteenth ce
Eight
- 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。全部使用C语言完成的-Eight queens problem is an old and well-known problem is a typical Example backtracking algorithms. All done using the C language
bags
- 四种算法（动态规划、回溯法、分支限界法、贪心法）实现0-1背包问题-four algorithms including dynamic planningm,tracing,branch and bound method and greedy to implement 0-1 bag problem.
Queen
- 实现多皇后问题的求解过程，利用了回溯算法。-eight Queens problem solution
BackTrack_01backpack
- 0-1背包问题是一个经典的算法问题，有多种解法，这里用回溯法求解。-0-1 knapsack problem is a classical algorithm for the problem, there are several solution here solved by backtracking.
bahuanghou
- 皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法-Queens problem is an old and well-known problem is a typical Example backtracking algorithms. The problem is that the nineteenth century,
8queens_by_MFC
- 用回溯算法MFC实现八皇后问题 不仅展示了使用Microsoft基础类的基本知识 而且也是MFC应用程序的起点 -Backtracking algorithm using MFC to achieve the eight queens problem is not only demonstrated the use of basic knowledge of Microsoft Foundation Classes MFC applications, but also the sta
4queen
- 四王后问题求解算法，用递归回溯算法求解。用C#编程，界面显示。-4queen
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming