搜索资源列表
The-Questions-of-Queues
- N皇后问题,介绍N皇后问题的工作原理，以及如何利用回溯法的工作思想来解决问题。-The Question Of Queues
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
NQ
- N皇后问题(位运算，C语言版) N皇后问题求解 位运算-N-Queens problem (bit computing, C-language version) N-Queens problem solving-bit computing
mpiqueen
- 基于MPI的N皇后问题，且剔除镜像解和旋转解-Of MPI-based N-queens problem and the solution removed the mirror solution and the rotation
N_queen
- 求N皇后问题的一个解，回溯法。在窗体文本框中输入N值，矩阵图显示皇后排布方式-Seek a solution of N-Queens problem, backtracking. In the form text box, enter the values of N, the matrix show the Queen arranged way
NQueens
- N皇后问题的解决方案，N*N的棋盘上摆放N个皇后的几种方案-N-Queens problem solution, N* N board, placing N queens of several options
Algorithm-analysis-and-design
- 计算机实验室 内容： 1、分治法，maxmin算法 2、动态规划，矩阵连乘 3、贪心法， 1）背包问题，2）装载问题 4、回溯法，N皇后问题的循环结构算法和递归结构算法。-Computer laboratory content: 1, partition method, maxmin algorithm 2, the dynamic planning, LianCheng matrix 3, greedy method, 1) knapsack probl
t1
- 主要是解决8皇后问题，同时可以通过改变数组大小解决N皇后问题，最后将结果输出到一个txt文档中-It is to solve the eight queens problem, and can solve the N queens problem by changing the size of the array, the final output the results to a txt file.
N-Queen
- 八皇后问题。N皇后。对角线同行同列不能放棋子-Eight queens problem
Eight-Queens-code
- 介绍了用回溯的方法解决八皇后问题。通过改变参数，还能扩展解决N皇后问题-Back method to solve the eight queens problem. By changing the parameters, but also extended to solve the N queens problem
asp.tar
- n皇后问题，汗诺塔问题，数独问题，地板问题的ASP解决方案。可以设置N的数目-n queens problem, Khan Notari, Sudoku, flooring problems ASP solutions. Can set the number of N
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
ThousandQueen
- N皇后问题，里面是一千的实例,利用人工智能的“爬山法”-The N queens problem，take a thousand as exzample by the methed of ‘hill climbing method’
16-queens
- 16(N)皇后问题，用回溯法和位运算结合编程，在效率上有很大的改进-16 (N) queens problem using backtracking and bitwise combination of programming, a great improvement on the efficiency
Nqueen
- 调用返回法实现n皇后问题，对回溯法进行了改编，回溯法和调用返回法的时间代价几乎一样-Almost the same as n-queens problem, call the Law of Return adaptation of backtracking, backtracking time to the consideration of the law and call the Law of Return
nQueen
- 用回溯算法解决n皇后问题，使用VC2008开发平台。-Backtracking algorithm to solve the n-queens problem, to use VC2008 development platform.
NQueens-returnback
- 使用调用返回的软件架构风格来实现N皇后问题，可以用于比较效率-using the renturn-back software archetecture style to solve the N-Queens problem
NQueens-filter
- 使用管道过滤的软件架构风格实现N皇后问题，可以用于比较运行效率-sove the N-Queens problem using filter style
nqueen
- 这个是计算机算法基础的n皇后问题，可以完美的显示处理的结果，有好几个程序-This is a computer algorithm based on n-queens problem, can the perfect display processing results, there are several procedures
huanghou
- N皇后问题，希望能够帮到大家-N queens problem, want to be able to help everyone