搜索资源列表
nqueens
- 用c编写的N皇后问题-used to prepare N Queens
aglorithm
- 问题算法源代码：骑士遍历、万年历、N皇后问题回溯算法、动态计算网络最长最短路线、货郎担分枝限界图形演示、货郎担限界算法、矩阵乘法动态规划、网络最短路径Dijkstra算法-problems algorithm source code : Knight traversal, calendar, N Queens backtracking algorithms, Dynamic computing network longest shortest routes, traveling salesman
liweiguang
- n皇后问题，费城经典的解决方法，用General-Search方法写的-n Queens problem,solved by classical Philadelphia method,using General-Search method.
Nqueen2.rar
- 使用另一种算法实现n皇后问题，现实运行时间及结果，附有算法,Another algorithm using the n Queens problem, the reality of time and results of operation, with algorithm
Queen
- 利用回溯法和栈来实现八皇后问题：在n×n的国际象棋棋盘上，安放n个皇后，要求没有一个皇后能够“吃掉”任何其他一个皇后，即没有两个或两个以上的皇后占据棋盘上的同一行、同一列或同一对角线-Use of backtracking and stack to achieve the eight queens problem: the n × n chess board, place n queens, a queen is not required to " eat" any other
Queen
- n*n的棋盘上放置彼此不受攻击的n个皇后，按国际象棋规则可知：皇后可以攻击同行同列同斜线的棋子-n* n chessboard placed on each other from attack of the n-Queens, according to chess rules we can see: Queen can attack the peer-pawn with the column with a slash
N-queen
- n皇后问题回溯法经典问题 主要用回溯法剖析n皇后问题-n queens problem back method Classic
N-quenes-problem
- N皇后问题，本程序采用二维数组处理N皇后问题，可由用户在运行过程中决定棋盘规格及皇后数目。-N queens problem, the program uses a two-dimensional array processing N-queens problem, decide the number of board specifications and Queen by the user during operation.
TabuSearch-for-N-Queen-Problem
- Tabu Search解N皇后问题 禁忌搜索算法求解N皇后问题-Tabu Search solution of the N-Queens problem tabu search algorithm for solving the N-queens problem
N-QWEENS
- 经典的N皇后问题，运用递归方法求解，具有一定参考价值-Classic N queens problem, using a recursive method for solving a certain reference value
n-Queen
- 在n*n格的棋盘上放置彼此不受攻击的n皇后。按照国际想起的规则，皇后可以攻击与之处在同一行或同一列或同一斜线上的棋子。n后问题等价于在n*n格的棋盘上放置n个皇后，任何2个皇后不放在同一行或同一列或同一斜线了。-Place each n is not an attack on the queen n* n chessboard grid. Think of in accordance with international rules, the Queen can attack at a pawn
N-huanghou
- N皇后回溯算法 课上使用小例子 仅供参考 -N Queens backtracking algorithm using a small example of the class
n-queen
- 在n×n的棋盘上摆放n个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上。-Placed on board nn n queens, it can not attack each other, that any two queen can not be on the same line, same column or diagonal.
n-queen
- n皇后问题的最简单解法，弄够帮助到大家。-n queens problem the easiest solution, get enough help to you.
eight-queens
- 八皇后问题，包括BFS，DFS和回溯法运算。也可以解决n皇后问题。- Eight queens problem, including BFS, DFS and backtracking operations. N queens problem can be solved.
N-Queue_DFS
- BFS法求解N皇后问题，输出全部解决方案。-BFS method for solving N queens problem and output all solutions.
N-Queens
- This is a C code for solving the N queen problem
BFS 求解 N 皇后问题(252370)
- BFS算法实现N皇后问题，12个皇后是速度还行，超过了就有点慢。(BFS algorithm to achieve N queen problem, 12 queens is the speed is OK, more than a little slow.)
爬山 完美
- 使用爬山法实现n皇后问题 输入 n，并用运行时间比较几种算法在相同规模的问题时的求解效率。列表给出结果。 比较同一算法在 n 不相同时的运行时间，分析算法的时间复杂性。(Use of climbing method to achieve the N Queens)
N皇后
- 八皇后问题，是一个古老而著名的问题，是回溯算法的典型案例。该问题是国际西洋棋棋手马克斯·贝瑟尔于1848年提出：在8×8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。(The eight queen problem, an old and famous problem, is a typical case of backtracking algorithms. It is put forward the internationa