搜索资源列表
classic_Problem_algorithm
- 包含几个经典问题算法,如骑士遍历,N皇后问题回溯等。对这些算法有兴趣的可以一看。-Algorithm contains several classic problems, such as the Knight traversal, N queens problem back and so on. Are interested in these algorithms can have a look.
Nqueensprobleseekingbackrackingalgorithmusingfromt
- 求 N 皇后问题回溯算法,用从C语言编写的。希望对大家有所帮助!-N queens problem seeking backtracking algorithm, using from the C language. We want to help!
Nqueensprobleseekingbackrackingalgorith
- n皇后问题回溯算法,用C语言编写的!希望对大家有所帮助!-n queens problem backtracking algorithm, written using C language! We want to help!
queen
- 用回溯法的思想解答 n皇后问题,掌握使用回溯法求解问题的基本思路-The idea with backtracking to answer n queens problem, master the use of backtracking to solve the problem of the basic ideas
wu
- 掌握使用回溯法求解问题的基本思路,用回朔法做n皇后问题-Use backtracking to solve the problem to master the basic ideas, with the retrospective method to do the n queens problem
nprime
- N Prime问题也可以成为N皇后问题,此算法这是回溯法,非递归实现.-N Prime problem can also be N Queens problem, this algorithm is backtracking, non-recursive implementation.
wtsf.tgz
- N皇后问题回溯算法.c 货郎担分枝限界图形演示.c 矩阵乘法动态规划.c 万年历 动态计算网络最长最短路线.c 货郎担限界算法.c 骑士遍历 网络最短路径Dijkstra算法.c-N queens problem backtracking algorithm. C TSP branch and bound graphical presentation. C matrix multiplication, dynamic programming. C calendar dynamic compu
queen
- n个皇后问题 在 n 行 n 列的国际象棋棋盘上,最多可布n个皇后。若两个皇后位于同一行、同一列、同一对角线上,则称为它们为互相攻击。 n皇后问题是指找到这 n 个皇后的互不攻击的布局。-n-Queens problem in n rows n columns of the chess board, up to n-Queens cloth. If the two Queens in the same row, same column, the same diagonal, then c
NQueue
- 利用回溯法求解N皇后问题及其算法性能分析。-The use of backtracking algorithms for solving N Queens problem and its performance analysis.
8queen
- 通过遗传算法求解N皇后问题,用c++编写-Through the Genetic Algorithm for N queens problem, using c++ write
nqueen
- 经典的N皇后问题,使用C++6.0开发,很好的-Classic N-Queens problem, the use of C++6.0 development, good
LPTc
- 8皇后问题,N皇后问题,随机算法,提高速度-this is a randomized solution of N Queens. with random algrithism, we can improve the speed of finding solution
queen
- 对N皇后问题进行优化,可以在较短时间内计算出皇后排列方法的个数-Optimized for N queens problem, you can calculate the Queen in a relatively short period of time means the number of ordered
qqq
- 很常见的N皇后问题,用矩阵的形式画除图, 1表示皇后的位置-Very common N-Queens problem, a matrix in the form of paintings, inter diagram 1 that the location of the Queen
N_QUEENS
- n-queens问题,目前最佳的解法为法国人pion所写-n-queens
zuiniudeNhuanghousuanfa
- 用位操作实现的求解N皇后问题,算法效率很高-Using bit operations to achieve the solution of N Queens problem, the algorithm very efficient
NQueens
- 经典的N皇后问题的实现,使用的算法是回溯法-Classic implementation of N-Queens problem, using the algorithm is backtracking
Queen
- 使用递归算法解决n皇后问题,可供初学递归者参考-The use of a recursive algorithm to solve the n queens problem, for beginners who refer to the recursive
nqueens.c.tar
- n-queens algorithm source code
Queens
- 程序功能:1.由n2个方块排成n行n列的正方形称为n元棋盘。 如果两个皇后位于n元棋盘上的同一行、同一列或同一对角线上,则称它们在互相攻击。 现要找出使棋盘上n个皇后互不攻击的布局。 2.编制程序解决上述问题, 用户输入0~30间的棋盘方阵,给出所有解决方案,并输出结果。 -queens of different table sizes