搜索资源列表
2
- 用回溯解背包问题 假设有n件物品，定义一个结构体a[]来存储，结构体有两个成员weight和value(weight表示重量，value表示价值)先定义一个数组col[]表示每个物品当前状态（为1表示被选，为0表示未被选），其初值全为1，从下标为0开始遍历，当前所选物品总重和总价值分别设为tw和tv（初值均为0），背包的限重设为limit，若第i个物品满足tw+a[i].weight<=limit且col[i]==1 就将a[i]
Sodoku
- 数独游戏解算C++代码，在vc6.0上运行，控制台，使用回溯法解决，首先输出的是一个满足规则的数独例子，接着可以自己输入已知点的个数及其坐标、数字（要求不能违反规则），然后会生成满足条件的一个例子。-Sudoku solver C++ Code, in vc6.0 run on the console, use backtracking to solve, first of all to meet the output is a sin
Sudoku
- 数独解法，能够解不要求回溯的数独问题，目前只支持用户自己出题。-Sudoku Solution, to the solution does not require backtracking Sudoku problem, currently only supports the user
lec26-backtracking
- 88 page of backtracking pdf in algorithms
DancingLinks
- 在计算机科学，舞蹈链接，也被称为的DLx ，是技术建议唐纳德克努特有效地执行其算法十算法X是递归，随意性，深度优先，回溯算法，认为所有的解决方案的确切覆盖问题。一些较为著名的确切涵盖的问题包括瓦工，n皇后问题，数独。-In computer science, Dancing Links, also known as DLX, is the technique suggested by Donald Knuth to efficientl
qishi
- 递归算法的实例--以骑士巡游为例做的控制台程序。主要设计到了递归回溯算法-Examples of recursive algorithms- to Knight-tour of the console to do the procedure as an example. The main design to a recursive backtracking algorithm
Backtracking
- 回溯法，对于ACM初学者是十分有价值内部资料-Backtracking for beginners ACM is a very valuable internal information
sudokusolver
- a sudoku solver can solve sudoku problems which contains one solution or no solution. using backtracking algorithm-a sudoku solver can solve solve sudoku problems which contains one solution or no solution. using backtra
jumphorse
- 解决棋盘的马从第一个位置开始跳经过每个位置，用回溯法解决-To solve the board' s horse began to jump from the first position through each location, using backtracking to solve
knight
- 骑士漫游的改进算法，回溯算法加贪心选择策略，n最大可以到128-Knight improved roaming algorithms, backtracking algorithms greedy selection strategy increases, n the greatest can go to 128
frame
- 用回溯法解决不是很麻烦的传教士和野人问题-By backtracking to solve is not very troublesome issue of missionaries and Savage
Sudoku
- 回溯法生成数独-Backtracking generates Sudoku
HORSE
- 回溯法的马周游问题 回溯法的马周游问题-Backtracking problem horse travel horse travel problems backtracking backtracking horse travel problems
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
CommonAlgorithmDesign
- 常用的算法设计方法集合，主要有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法-Algorithm commonly used method of collection, mainly iterative, exhaustive search methods, recursion, greedy method, backtracking, divide and conquer, dynamic programming
TSP
- 回溯法解决TSP问题，对于任何的无向图，只要存在回路均可找到，无回路也可检测出来！-Backtracking to solve TSP problem, for any undirected graph, loop as long as there can be found, no loop can be detected!
DesignMataboard
- 算法分析与设计 马踏棋盘的一般回溯法（要求马回到最开始的出发点）.-Algorithm Analysis and Design of horse riding board' s general backtracking (required horse back to the starting point).
bahuanghou
- 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-Eight queens problem is an old and well-known problem is a typical example backtracking algorithm. The pr
maze-backtracking
- 迷宫是许多小方格构成的矩形，在每个小方格中有的是墙（图中的“1”）有的是路（图中的“0”）。走迷宫就是从一个小方格沿上、下、左、右四个方向到邻近的方格，当然不能穿墙。设迷宫的入口是在左上角(1,1)，出口是右下角(8,8)。根据给定的迷宫，找出一条从入口到出口的路径。 采用回溯法-Maze is composed of many small rectangular box in each small box in plenty of w
nqueens-recursion-backtracking-n^n
- n皇后问题的递归回溯实现， 状态数：n^n-n queens problem of recursive backtracking implementation, the number of states: n ^ n