搜索资源列表
QUEEN
- 這是利用基因演算法來計算皇后問題的小程式 絕對是狠快速的方法
kingho
- 皇后问题：在N*N的方格里放置皇后，要求不能放在同一行、同一列、同一对角线上。输入所有适合条件的情况。-Queen : N * N in the box, placed the empress, on the request can not be the same line, the same series on the same diagonal. The importation of all suitable conditions.
Nqueenn的C++源码
- 采用c++编写,上机运行通过的N皇后实现代码,绝对可用-used to prepare, on the plane running through the realization of the code N Queen's absolutely available!
Queen_lv
- 采用LasVegas概率算法高效解决N皇后问题，并统计其成功与失败的概率，这是中国科技大学的高级算法设计的设计-LasVegas probability algorithm used to solve N Queen efficient, and its success or failure of statistical probability, which is China University of Science and Technology Advanced Algorithm Desi
Queen
- 经典的8皇后java源代码 可以稍作改变成为迭代式-8 Queen
8-queenProblem
- The famous 8-queen problem in java
EightQueens
- 利用C#语言实现的八皇后问题。只有8*8的棋盘形式，可以输入皇后摆放的位置-This program is used by c#,which called eight-queen .It can show every situation about the able place to put the queen.But there is a disadvantage that it is set only 8*8 chess .
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
8-Queen
- 8-Queen problem, that is one of the most famous algorithm problem.
n-queen
- N-queen soluotion. Print into screen the the solution of queen in the chess board
eight-queen
- 著名的八皇后问题，是回溯算法的典型例题。该问题是19世纪著名的数学家高斯1850年提出：在8*8格的国际象棋上摆放8个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-The famous Eight Queens problem, backtracking algorithm is a typical example. The problem is the famous 19th century mathematician Gauss 1850: U
8queen
- 8 queen problem coded in c.
EightQueenQuestion
- 经典的8皇后数学问题的C语言实现。经测试可运行。运行环境TurboC2.0.-Eight Queen Question realization by C program.TurboC2.0.
Queens-problem
- 经典的皇后问题，可直接放在C++工程运用，控制台操作，以图形方式输出，简单明了，易学易用 -Classic queen problem, can be placed directly on the C++ project to use the console operation, graphical output, simple, easy to use
Algorithm-analysis-and-design
- 计算机实验室 内容： 1、分治法，maxmin算法 2、动态规划，矩阵连乘 3、贪心法， 1）背包问题，2）装载问题 4、回溯法，N皇后问题的循环结构算法和递归结构算法。-Computer laboratory content: 1, partition method, maxmin algorithm 2, the dynamic planning, LianCheng matrix 3, greedy method, 1) knapsack probl
8-queen
- It is a graphical representation of the famous 8 queen problem . the program is in accordance to the algorithm described in Cormen.
queen
- 这道题的算法思路比较简单，其重点在于对搜索的剪枝优化，由于如果对于每一行都枚举每一列，显然其中会有很多在枚举过程中就可以判断不可能出解的情况，显然对这些情况的继续向下一行搜索是无用的冗余操作，所以我们应在枚举搜索中加入一些判断条件，以减少无用的搜索分支。 -Algorithm of solving the problem is relatively simple idea, with its emphasis on the search pruning technique, because
The-assembly-line-scheduling-problem
- 御用动态规划思想和策略，解决装配线调度问题。-Queen dynamic programming ideas and strategies to address the assembly line scheduling problem.
eightqueen
- 经典问题 8皇后,使用深度优先搜索算法。-8 Queen classic problem, using a depth-first search algorithm.
Queens
- Queen problem is solved