搜索资源列表
01-8queens
- n皇后问题,rar格式,运行环境c++,n〉=1-n Queens problem, rar format, operating environment c++, n> = 1
hu_8queen_scr
- 以VC6写的用遗传算法解决8皇后(8queens)问题,包括遗传算法介绍和代码的使用方法说明word文档-to write using genetic algorithms to solve the Queen (8queens). including genetic algorithms and code on the use of the methodology word document
bhh1
- 八皇后问题源代码,简单易懂,适合经验较浅者使用-8 Queens source code is simple to understand and suitable for inexperienced users
Genetic
- 用遗传算法解决八皇后问题! 有比较详细的注释! 还有有关遗传算法理论的描述。 -Using genetic algorithms to solve the issue of the eight Queen
nqueen
- 有关一个N皇后的问题。用户只要改变开始宏定义是的 QUEENS的值就可以验证 皇后的具体分布情况;如 8 皇后 则会输出具体的92中放置方法;-On a N Queen
nhuanhou
- n皇后的问题,求出总共的解法数,并显示其中一种的解法-n Queens problem, the solution obtained a total number, and show that one of the Solution
8gehuanghou-vc
- 八皇后问题:在8行8列的棋盘上放置8个皇后,使任一个皇后都不能吃掉其他的7个皇后,即没有任何两个皇后被放置在棋盘的同一行、同一列或同一斜线上。-8 Queen s problem: In line 8 of 8 chessboard placed 8 Queen s, so that one of Queen s can not eat the other 7 s, that is, no two Queens were placed
nqueen
- 解决N皇后问题,使用的是C++编写的,有兴趣的可以-Solve the N Queens problem, using a C , prepared, interested can
8queens
- 由C语言编写的八皇后算法的图形演示版,注意:需要设置C代码中的graphic库的正确位置。程序可以演示八皇后的所有解,并能够根据用户的要求找到某一特定解-By the C language algorithm eight queen graphics demo, pay attention: the need for C code in the correct position of graphic library. Program c
8_Queen
- 此算法为8皇后问题,是本人自己写的算法,运行还不错!-This algorithm for the 8 Queens problem is to write my own algorithms, running good!
N-Queens
- 此N皇后问题更具通用性,虽然在N=16时运行时间过长,但是还是有意义的。-This N Queen
Debug
- 贪心算法,8皇后问题-Greedy algorithm, 8 Queen s problem
NQueens
- 这是一个八皇后问题的扩展,使用java实现,扩展到了多皇后,只要你输入皇后的个数,能给出所有的解。-This is an expansion of 8 Queen
8queens
- the main function of this C++ source file is actualize how to find the loads of 8 queens.
n-queens-mm
- c实现n皇后m棋盘, c实现n皇后m棋盘, -c realization of n
8QUEENS
- c语言算法中的8皇后问题的解答 而且结果的输出很漂亮 一眼就明白-c language algorithm 8 Queen s questions and the results of the output is very beautiful to understand at a glance
nqueen
- 用c++语言实现n皇后问题,您可以输入N值,程序可为您实现。-With c++ Language n Queens problem, you can enter the N value, the procedure for you.
Queens
- 皇后问题:计算各种情况下的棋盘上皇后的摆放位置-Queen s problems: calculation of a variety of situations on the board the location of Queen s
queen
- 在一个8×8国际象棋盘上,有8个皇后,每个皇后占一格;要求皇后间不会出现相互“攻击”的现象,即不能有两个皇后处在同一行、同一列或同一对角线上。问共有多少种不同的方法。-In an 8 × 8 chess set, there' s eight, each accounting for one' s cell request will not be mutual between Queen' s " attac
QueensProblem
- source code for Queens problem using tabu search