搜索资源列表
Nqueen
- 这是处理“皇后问题”问题的代码，所谓的皇后问题就是一个棋盘可以放多少个皇后棋子却不会冲突。-N queen
nqueens
- 输入皇后数量N，输出一种N皇后的分布排列方法-Arrangement of the distribution of the number of input Queen N, O N Queen
algorithm
- 各种经典问题的求解方法，如N皇后问题回溯算法，动态计算网络最长最短路线，货郎担限界算法，网络最短路径Dijkstra算法-All kinds of classic problem solving methods, such as N queen problem back in the algorithm, the dynamic calculation longest shortest route network, HuoLangDan gauge algorithm, the network
nqueens
- its n queen problem solution. enjoy
8_queen
- 8皇后问题的解决算法，VC++实现，输入N皇后，输出算法迭代次数-8 queens problem solution algorithm, the VC++ to achieve N Queen, the output of algorithm iterations
Fast_Nqueue
- 快速N-queue 演算法.使用 backtracking 在n*n 的棋盤上產生所有的可能解答, -Fast N-queen solution. Using backtracking to generate all possible placements of n queen on a n*n chessboard so they are non-attacking.
BIT-N-queen
- 皇后问题是经典的回溯算法问题，本文使用BIT位运算对非递归的回溯算法进行优化，取得了较好的效果,对其他类似问题的算法的优化有一定指导意义-Queens problem is a the classic backtracking algorithm, BIT bit computing to optimize non-recursive backtracking algorithm, and achieved good results, the optimization algorithm to
Nqueen
- 回溯法算法解决8皇后问题，可推广到N皇后-Backtracking algorithm to solve N queen problem
queen
- 算法设计与分析 java n后问题源码 王晓东书版本上的课堂练习的完整代码-Classroom exercises after the the problem source Wang Xiaodong book version of the complete code for the algorithm design and analysis of java n
xxqueen_problem_genetic_algorithm
- Genetic Algorithm for n-queen problem
qqq
- c++n皇后问题 主要是用c++来实现 大家可以看看 交流交流-c++n Queen is the c++ to realize that we can take a look at the exchange of communication
Nhuanghou
- 这是我自己做的N皇后实验，是一个小型的学生信息管理小系统，供新手学习-This is my own N Queen experiments, a small student information management system for the novice to learn
q
- c++编写的N皇后问题，用递归实现的，仅供学习使用-N-queen problem using C++,only for study hope can help you
nqueen
- 遗传算法解决N皇后问题，是一份大作业，有非常详细的文档，推荐下载。-Genetic algorithms to solve N queen problem, is a great work, have a very detailed documentation, recommended download.
NQueens-using-java
- n queeen using java using java to solove n queen proplem
NQueens-using-c
- using c to solve n queen problem
queen
- 输出8皇后问题所有结果。每个结果第一行是No n：的形式，n表示输出的是第几个结果；下面8行，每行8个字符，‘A’表示皇后，‘.’表示空格。不同的结果中，先输出第一个皇后位置靠前的结果；第一个皇后位置相同，先输出第二个皇后位置靠前的结果；依次类推。 -Output all the results of the 8-queens problem. The first line of each result in the form of a No n: n output is several r
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.
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