搜索资源列表
-
0下载：
八皇后问题是：在8*8的国际象棋棋盘上，安放8个皇后，要求没有一个皇后能够“吃掉”任何一个其他的皇后，即没有两个或两个以上的皇后占据棋盘上的同一行、同一列或同一条对角线。-Eight queens problem is: 8* 8 chess board, placed eight at Queen' s, a Queen' s request was not able to " eat" any of the other Queen' s, that is,
-
-
0下载：
八皇后问题是：在8*8的国际象棋棋盘上，安放8个皇后，要求没有一个皇后能够“吃掉”任何一个其他的皇后，即没有两个或两个以上的皇后占据棋盘上的同一行、同一列或同一条对角线。-Eight queens problem is: 8* 8 chess board, placed eight at Queen' s, a Queen' s request was not able to " eat" any of the other Queen' s, that is,
-
-
0下载：
一些很经典的算法！！！包括八皇后问题和背包问题，排列组合问题和数字拆分问题等.-Algorithm for some very classic! ! ! Including the eight queens problem and the knapsack problem, permutation and combination problems and digital split issues.
-
-
0下载：
这是一个关于八皇后问题用回溯法求解的java解法！-This is the one on the eight queens problem using backtracking method for solving the java solution!
-
-
0下载：
基于Hopfield网络的八皇后问题，附带原版论文和实验报告-Hopfield network based on the eight queens problem, with original papers and lab reports
-
-
0下载：
八皇后问题 包括棋盘大小改变等功能全实现-Eight queens problem, including changing the size of features such as full-board implementation
-
-
0下载：
八皇后问题 eclipse下使用 输出数目并打印 有注解-Eight queens problem using eclipse the number of output and print a comment
-
-
0下载：
八皇后 进一步加深编程，进一步难度为N皇后问题-Eight Queens program to further deepen and further difficulty for the N queens problem
-
-
0下载：
八皇后问题的一个简单实现，带图形化界面的，用swing写的-Eight queens problem, a simple implementation, with graphical interface, written with the swing
-
-
0下载：
八皇后问题：任何两个皇后都不能互相攻击（即没有两个皇后是在同一行、同一列、同一对角线上）。-Eight queens problem: no two queens can attack each other (ie, no two queens in the same row, the same column on the same diagonal).
-
-
0下载：
回溯法非递归实现8皇后问题，控制台图形显示-Non-recursive backtracking to achieve eight queens problem, the console graphics
-
-
0下载：
八皇后问题的单一解法以及所有解法的输出，看注释即可明白；-Eight queens problem solution as well as all of the solution of a single output, see the notes to understand
-
-
0下载：
八皇后问题java实现源代码
在控制台显示了八皇后问题的其中一解-Eight queens problem java source code in the console shows the eight queens problem in which a solution of
-
-
0下载：
利用递归机制，可以很容易的求解n皇后问题。针对八皇后，总共有92种解。下面将给出N-皇后问题的一般求解代码，在这里代码是使用java编码的。-Recursive mechanism that can easily solve the n-queens problem. For eight queens, a total of 92 kinds of solutions. The following will give a general N-queens problem solving code
-
-
0下载：
用JAVA实现的八皇后问题展示，多线程实现。运行时请自行添加queen.jpg作为资源文件到工程目录下。-In the JAVA implementation of eight queens problem show, multithreading implementation.Runtime please add your own queen. JPG as a resource file to the project directory.
-
-
0下载：
递归算法：八皇后问题，成功实现递归算法——八皇后问题，程序注释详细，结构紧凑。-Recursive algorithm: the eight queens problem, the successful implementation of recursive algorithms- the eight queens problem, detailed program comments, compact structure.
-
-
0下载：
java实现八皇后问题，能够直接运行，代码容易理解-java achieve the eight queens problem
-
-
0下载：
八皇后问题 简单源代码 适于初学者 利用数组链表分别实现-Eight queens problem is simple for beginners to use the source code to achieve an array of linked lists are
-
