搜索资源列表
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
final_project
- This is a solver for the N-Queens problem.
NQueens
- résolution de probleme de n queens
nqueens_v1
- N queens problem solved by algorithm
Queen
- 算法分析与设计 用回溯法实现n皇后问题(java源码)-Algorithm Analysis and Design N-queens Problem Using Backtracking
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#
Nqueen
- 给出了用三种方法实现的N皇后，包括循环、递归、位运算等，方便初学者进行研究学习。-Three ways to achieve the N-Queens, including loops, recursion, bit operation, easy for beginners to study learning.
NQ
- 该文件为使用C语言编写的N皇后问题的源代码!-N-queens problem using the C language source code!
ex
- C++编写的各种示例程序有N皇后，旋转方阵，字符串等等，刚学C++的可以参考-The the various sample program written in C++ N-Queens, rotation matrix, string, just learning C++ can reference
CSP
- 使用最小冲突法实现的N皇后问题，其中，通过构造的方法产生初始解，因此，千万级别的皇后只需要4s左右-Minimum conflict of laws to achieve the N-queens problem, which constructed the initial solution, therefore, thousands of levels Queen 4s
Nhuanghou
- 这是一个经典8皇后问题的拓展，将其推广到N皇后，病输出所有结果。-This is a classic 8 queens problem expansion will be extended to the N-Queens disease output results.
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
8queens
- Eight Queens Problem : Here are my solutions to the N-Queens / 8 queens Problem . Regarding the display of solutions : The solutions appear in the following format :: Example : SOLN 1 : (1,1) (2,5) (3,8) -Eight Queens Problem : Here are my so
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.