搜索资源列表
Queenquestion
- N皇后问题 主要是运用递归来做的一个算法-the question of the queen
3
- C语言版,C/C++开发环境均可用,如VC。可学习借鉴 问题算法 骑士遍历 万年历,N皇后问题回溯算法.c 货郎担限界算法.c-C language, C/C++ development environment can be used, such as VC. Algorithm can learn from the question of ergodicity calendar Knight, N Queen' s problem backward algorithm.
DataStruct
- 此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历 HeapSort利用堆排序实现优先级队列 Merge实现二路归并排序算法 MFK动态规划解背包问题 nqueue求解n皇后问题 QuickSort快速排序算法的实现。 Shell排序算法的实现。 Tree程序
nhou
- 编写程序对N皇后问题进行求解:在8行8列的棋盘上放置N个皇后,使任一个皇后都不能吃掉其他的(N-1)个皇后(注:皇后可吃掉与她处于同行或同列或同一对角线上的其他棋子),并将结果以某种方式显示出来-After the issue of N
DancingLinks
- 在计算机科学,舞蹈链接,也被称为的DLx ,是技术建议唐纳德克努特有效地执行其算法十算法X是递归,随意性,深度优先,回溯算法,认为所有的解决方案的确切覆盖问题。一些较为著名的确切涵盖的问题包括瓦工,n皇后问题,数独。-In computer science, Dancing Links, also known as DLX, is the technique suggested by Donald Knuth to efficiently implement his Algorithm X. A
Queue
- 用回溯法实现n皇后问题,c++语言编写,调试通过。包含代码和完整文档说明-By backtracking the question of the realization of n queen, c++ languages, debugging through
yuandaima
- 一般背包问题的贪心算法 Dijkstra算法求解单源最短路径问题 N皇后问题 Prim算法 Kruskal算法代码-The general knapsack problem greedy algorithm Dijkstra' s algorithm for single-source shortest path algorithm N Queen' s problem Kruskal Algorithm Prim code
Cpp1
- N皇后问题求解,根据不同的N值得出不同的求解结果-N Queen' s problem solving, based on different N should be the result of different solution
myQueen
- 解决算法分析和设计中的n皇后问题,并动态显示查找皇后放置位置的过程-Analysis and design of algorithms to solve the n Queen and Queen' s dynamic display to find the location of the process of placing
NQueens
- N皇后问题的实现,用回溯法实现N皇后问题-N Queen' s problem of the realization method used to achieve N Queen' s back issues
Queen
- n皇后 在一定范围内,可以输出n皇后问题的所有解。-solve the "n queen" problem.
nqueen
- 该程序利用C++环境,实现了N皇后问题。当输入的皇后个数是13时,运行速度还相当可以。当个数增加到14的时候,运行速度就相对慢了下来,不过运行出正确的结果是没有问题的。-This process uses the c++ circumstance,and it accomplished the N Queens problem.when the input number is 13,the running speed is at a fairly rapid pace.when the inpu
06083301
- n皇后问题,对于给定的皇后的个数,找出所有的路径-find out all the ways to put the queen
source
- n皇后问题的实现 mfc做的 用回溯算法实现 超过30个以上皇后算法比较慢-n the question of the realization of Queen mfc backtracking algorithm used to do to achieve more than 30 more than the Queen' s algorithm is relatively slow
Nqueen1
- 实现n皇后问题的实现,排列出所有的结果,并显示运行时间,附有算法描述-To achieve the realization of n queen problem, with all the results and show the running time, with algorithms described in
jump_omp.c.tar
- 基于C的OPENMP并行计算的N皇后问题-C-based parallel computing OPENMP the N-Queen problem
FourQueen
- N皇后问题的解决方案,利用回归的方法.方法易懂-N Queens solution to the problem, using regression. Methods to understand
NQueens
- 利用回溯算法求解n皇后问题;并通过本例熟悉回溯算法在程序设计中的应用方法。-The use of backtracking algorithm to solve n queens problem and are familiar with the passage of the cases of backtracking algorithm in the program design should be applied.
n_queen_problem
- 在VC6.0环境下实现的n皇后问题,供需要的朋友参考-In the VC6.0 environment to achieve n-queens problem, for a friend in need for reference
las
- 使用拉斯维加斯随机算法解决N皇后问题 可以以较快速度解决128皇后 甚至是256皇后问题-Use Las Vegas randomized algorithm to solve the N Queens problem can be resolved more rapid pace of 128 or even 256 Queen Queens Problem