搜索资源列表
nQueer
- n皇后问题的vc++解法，供朋友们参考，比较有益，一起学习吧
n_queen_problem_new
- 数值分析中的N皇后问题，程序中含输入/显示界面，N的数值可在界面中自行设定。
8huanghou
- 运用递归解N皇后问题以及递归问题的研究
N2
- n皇后问题（c++编写）-n Queen (c preparation)
eight_huanghou
- 八皇后问题，回溯算法的经典例子，此程序可以扩展至n皇后问题。-eight Queen's problems, backtracking algorithms classic example of this procedure can be extended to n Queen's problem.
算法分析与设计多媒体
- 在毕业设计期间由多人开发的一个算法演示系统，它包n皇后问题、拉维斯加算法等-This is a algorithm demo system developed by some persons, which including n queen problem, Laplac algorithm,etc.
liweiguang
- n皇后问题，费城经典的解决方法，用General-Search方法写的-n Queens problem,solved by classical Philadelphia method,using General-Search method.
tNQueens
- 链式结构堆栈类的类模板实现及用堆栈类求解N皇后问题-chain structure of the stack type and class template stack used for solving problems N Queen
n皇后问题
- 五子棋游戏 功能 1：实现人先下或机器先下 2：可以悔棋
启发式搜索
- 利用启发式修补解N皇后问题
n-queen
- 解决最多28个皇后问题，用backtracing+forwardChecking+reschedul-variable
Nqueen2.rar
- 使用另一种算法实现n皇后问题，现实运行时间及结果，附有算法,Another algorithm using the n Queens problem, the reality of time and results of operation, with algorithm
8-queen
- 通过遗传算法实现八皇后的求解问题，用MFC实现可视化操作，界面很漂亮，算法是改良的遗传算法-Through the genetic algorithm for solving the eight queens problem
n_queen
- 还是用分支限界法解N皇后问题，已成功运行过。-Using branch and bound Solving N Queens, which has been run successfully over
climbling
- 爬山法和遗传算法解决n皇后问题及可视化演示。-Hill-climbing and genetic algorithm to solve n-queens problem and visual presentation.
queen
- 运用回溯法解决8皇后问题，进而可以使用本方向推广到N皇后问题。-The use of backtracking to solve 8 queens problem, in turn, can be extended to use the direction of N Queens problem.
nQueen
- n皇后问题，亦是经典算法与分析题目，通过回溯的方法，解决此问题-n queens problem, is also a classical algorithms and analysis of the subject, through the back way to solve this problem
nhuanghouwenti
- n皇后问题的求解，有具体的演示结果，并含有结果的个数-n queen problem solving, there are specific demonstration results, and contains the results of the number of
NQueens
- 这是一个八皇后问题的扩展，使用java实现，扩展到了多皇后，只要你输入皇后的个数，能给出所有的解。-This is an expansion of 8 Queen