搜索资源列表
Nqueen
- 8皇后一直是C语言中的经典问题,本代码利用回溯法解决了N皇后问题-8 Queen has been a classic problem in the C language, the code uses backtracking to solve the N queens problem
Nhuanghoug
- N皇后问题采用位算法来运算,速度很快,但是最多只适合32个皇后的运算-N queens problem by bit algorithm to compute, very fast, but only for a maximum of 32 Queen s operations
n-queens-graphical
- n-queens graphical,是算法分析与设计里N皇后的c+=代码,程序将问题进行了图形化-n-queens graphical
NQueen
- 使用人工智能的方法和思想实现了N皇后问题。-Using artificial intelligence methods and ideas to achieve the N-Queens problem.
NQueen
- N皇后问题的快速实现 主要使用的位操作得以提速-N-Queens problem quickly realize the main use of bit operations to speed
nqueen
- n皇后问题的一种算法求解,,适合简单编程理解递归和数据结构-n-queens problem solving an algorithm, suitable for simple programming and data structures to understand recursive
NQueen
- 可以求解N皇后问题,用的也是王晓东的书上讲的方法!希望对大家有些用处!-Using this codes you can solve n-!Queens problem!
nqueens.tar
- N皇后问题的所有解演示,用Qt做的-N-Queens problem all solutions demonstrate, to do with Qt. . . . . . . . . . . . .
N-Queen-problem
- 可以实现N皇后的问题 运用简易算法 大大降低了耗时-N-Queens problem can be achieved using simple algorithm greatly reduces the time-consuming
2
- N皇后问题,递归实现,适合初学算法的同学,希望能对你们有所帮助-N-Queens problem, recursive, algorithm suitable for beginner students, I hope you can help
n_queen
- 关于N皇后问题,通过探讨N后问题得到一些结论性的东西-On the N-Queens problem, after problem by exploring some of the conclusions N of the things
NQueen
- 本程序由八皇后问题出发,为解决N皇后问题。本程序是跨平台设计,由宏UNIX选择是UNIX还是WIN 。-The procedure starting from the eight queens problem, to solve N-Queens problem. The program is cross-platform design, the choice is UNIX or UNIX macro WIN.
GA_NQueen
- 遗传算法解决N皇后问题,并经过一些优化,得到了较好的效果-Genetic algorithm to solve N-Queens problem, and after some optimization to get good results
NQueen_bit
- N皇后问题的一种简单解法,利用位运算来解决,当N较大时,能有效算出解法的种数。-N-Queens problem is a simple solution, the use of bit operations to solve, when N is large, it can effectively calculate the solution of the species.
NQueen
- n-皇后问题的迭代回溯解法,里面是完整的程序。可以运行。本人亲写。-n-queens problem iterative back solution, which is a complete program. Can run. I am pro-write.
eight-queen
- 八皇后问题及n皇后问题求解,数据结构的经典算法,及课程设计的需要-eight queen problem .data sructment problem
bahuanghou
- 利用递归方法来求解著名的八皇后问题,还可以拓展求n皇后问题-Well-known recursive method to solve the eight queens problem, you can also expand the demand n-queens problem
N-HuangHou
- 主要内容 八皇后问题是一个古老而著名的问题,是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出:在8X8格的国际象棋上摆放八个皇后,使其不能互相攻击,即任意两个皇后都不能处于同一行、同一列或同一斜线上,问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解,后来有人用图论的方法解出92种结果。-Main content of eight queens problem is an ancient and well-known probl
Three
- recall.c:回溯法求有向图是否存在回路,将结果输出到文件中。dfs.c:深度优先搜索解决N皇后问题,结果输出到文件。Client.java:一个java编写的即时通讯小程序。-recall. depth-first search. Instant message.
nqueen
- N皇后问题,简单的递归算法,代码简单适合刚开始学习的同学参考-N-queens problem, a simple recursive algorithm, the code is simple for students just beginning to learn reference