搜索资源列表
eightqueens
- n次递归回溯算法，采用上对角线，下对角线的方法解决n皇后难题。并且将皇后和棋盘大小参数化，只要改变参数就能进行n皇后问题的求解，并且输出到文件中，便于查看所有解。-n recursive backtracking algorithm, on the diagonal, and solutions under the diagonal n Queens problem. And parameterization of the Queen and board size, simply changin
q
- c++编写的N皇后问题，用递归实现的，仅供学习使用-N-queen problem using C++,only for study hope can help you
EightQueens
- 数据结构中的经典 N皇后问题，利用C#代码模拟，并输出可能结果。-Data structure in the classic N-Queens problem using C# code analog output may result.
nqueen
- 遗传算法解决N皇后问题，是一份大作业，有非常详细的文档，推荐下载。-Genetic algorithms to solve N queen problem, is a great work, have a very detailed documentation, recommended download.
NQueen
- 简单的N皇后问题，能实现，可以正常运行-Simple N-queens problem, to achieve normal operation
queen
- 基于回溯法的n皇后问题，使用的软件是visual c++6.0，还有详细的中文注释。-Backtracking based on the n-queens problem, the use of software the visual c++6.0, there are detailed notes in Chinese.
Nqueen
- 经典的N皇后问题，用VC编程实现N个皇后不想冲突的模式，并将各种模式打印出来-Classic N-queens problem, the N queens do not want conflict mode, and print out various modes VC programming
queen
- 对八皇后问题的递归算法的实现及其扩展成n皇后问题-Eight queens problem recursive algorithm to achieve its expansion into the n-queens problem
nQueen
- 计算机算法设计与分析。解决N皇后问题C#实现-Solution of N-queens problem implemented by C#
NQ
- 该文件为使用C语言编写的N皇后问题的源代码!-N-queens problem using the C language source code!
code
- 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Uses backtracking method to solve the problems of the typical algorithms: the knight tour problem, n queen problem, 0-1 knapsack problem. Recursion and divide and conq
CSP
- 使用最小冲突法实现的N皇后问题，其中，通过构造的方法产生初始解，因此，千万级别的皇后只需要4s左右-Minimum conflict of laws to achieve the N-queens problem, which constructed the initial solution, therefore, thousands of levels Queen 4s
n_queen_QS4
- 利用QS4算法解决N皇后问题，解决300万的皇后所需时间在5s左右，特别快-Use QS4 algorithm to solve the N-queens problem, solve 3000000 Queen the time required for about 5s, particularly fast
N_queen_QS2
- 利用QS2算法解决N皇后问题，解决50万的皇后所需时间在5s左右，特别快-QS2 algorithm to solve the N-queens problem, solve 500000 Queen the time required for about 5s, particularly fast
nprince
- 解决了n皇后问题，代码比较短，运用了迭代-Solve the n-queens problem, the code is relatively short, the use of iterative
code
- 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to so
NQueen(pa-shan-fa)
- 人工智能-爬山法解决N皇后问题，vs2010编写，代码有注释，可轻松理解。-AI- climbing method to solve the N-Queens problem, vs2010 written code annotated, easy to understand.
EasyCP-0.1.22010
- 此源码用于进行约束求解， 可以解决很多约束满足问题， 例如N皇后问题。-This source is used for constraint solving, constraint satisfaction can solve many problems, such as N-Queens problem.
nHuangHou
- 队列式分支界限法实现的n皇后问题，采用文件的方式输入输出-Queue-type branch and bound method to achieve the n-queens problem, using the method of file input and output
nqueen
- n皇后问题，计算机算法经典问题，本算法为给于C++的优化算法-n-queens problem, the classic problem of computer algorithms, this algorithm optimization algorithms give C++