Location:
Search - queen
Search list
Description: 著名的n皇后问题 在一个棋盘上， 如果任意两个皇后排在同一行或者同一列上就会互相残杀， 此算法用以解决棋盘上n个皇后如何排列才能不互相残杀。 -N the famous Queen s problem in a chessboard, if any two of Queen s in the same line or on the same row will be killing each other, the algorithm to solve n chessboard with a Queen How can we not kill each other.
Platform: |
Size: 161792 |
Author: piki |
Hits:
Description: 自己收集的八皇后问题相关知识,有不少源代码,能解决八皇后问题-Queen
Platform: |
Size: 290816 |
Author: chenzeng |
Hits:
Description: 应用JBuilder环境，编程实现经典的八皇后问题，其中共92种排列方法，均以+QX等符号给出排列位置-Application JBuilder environment, and programming to achieve the eight Queen s classic, which with a total of 92 kinds of methods, are+ QX symbols are given with the location of
Platform: |
Size: 4096 |
Author: ruohana |
Hits:
Description: 这是八皇后算法，自己写的，但是主题思想一样，深度优先，大家参考-This is the eight Queen s algorithm, wrote it myself, but the main idea, the depth-first, we refer to
Platform: |
Size: 33792 |
Author: han |
Hits:
Description: 在一个Ｎ×Ｎ的国际象棋棋盘中摆Ｎ个皇后，使这Ｎ个皇后不能互相被对方吃掉。
N皇后算法源码-N × N in a chess board in N months before Queen s, so that the N-Queen s was the other side can not eat each other. N Queen s algorithm source code
Platform: |
Size: 2048 |
Author: 张晓 |
Hits:
Description: 使用人工智能的遗传算法来解N皇后问题，能已较快的速度来搜索N皇后。-The use of artificial intelligence genetic algorithms to solve N Queen s problem, can have high speed to search for N Queen.
Platform: |
Size: 33792 |
Author: ganbin |
Hits:
Description: 可以用于解算国际象棋中的八皇后问题，即如何排列8个皇后使之之间不能互相吃-Solver can be used for chess in the eight Queen s question, that is, how to order 8 so that between the Queen s can not eat each other
Platform: |
Size: 37888 |
Author: 钟灿 |
Hits:
Description: 经典的8皇后java源代码
可以稍作改变成为迭代式-8 Queen
Platform: |
Size: 1024 |
Author: Michael |
Hits:
Description: 在一个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 " attack" phenomenon, that should not have two Queens in the same line, the same row or the same diagonal. Asked how many different ways.
Platform: |
Size: 337920 |
Author: huaying |
Hits:
Description: 这是一个解决皇后问题的遗传算法，是用c语言编写的，可以直接运行。-This is a solution to the problem' s genetic algorithm, are prepared using c language, can be directly run.
Platform: |
Size: 184320 |
Author: 刘振 |
Hits:
Description: 八皇后问题,递归和分治算法的初步结合,可在VC6.0环境下调试,可修改其中注释部分以观察运行步骤-Eight queen problem, the recursive division algorithm and the initial integration of environment in the VC6.0 debugger to modify one part of the Notes in order to observe the operation of steps
Platform: |
Size: 6144 |
Author: 鲁林涛 |
Hits:
Description: 八皇后问题的代码，有详细的注释，运行后可以给出八皇后问题的所有92个解。-Eight queen problem code has detailed notes, running eight queen problem can give all the 92 solutions.
Platform: |
Size: 2048 |
Author: luxin |
Hits:
Description: N-Queen solver written in java with excellent Graphical user interface.
Platform: |
Size: 4096 |
Author: sandeepan1986 |
Hits:
Description: 八皇后C++递归实现 以及AKM的C++实现-Eight Queen' s C++ recursive implementation as well as the AKM' s C++ implementation
Platform: |
Size: 1024 |
Author: gaef |
Hits:
Description: 在plt schenme 下用scheme函数式程序语言所写的八皇后问题，基于一个特殊的框架-At scheme using plt schenme Functional programming language written by the Queen' s eight questions, based on a special framework
Platform: |
Size: 1024 |
Author: 方程 |
Hits:
Description: 这是在Jcreator下用java语言编写的八皇后问题，采用递归回溯解决，在控制台打印输出92个解-This is at Jcreator using java language eight Queen' s problem using recursive backtracking resolved, at the console printout 92 Solutions
Platform: |
Size: 1024 |
Author: 方程 |
Hits:
Description: JAVA 采用递归的方式实现八皇后问题 -JAVA implementation using recursive manner eight queen problem
Platform: |
Size: 1024 |
Author: nightkid |
Hits:
Description: N皇后问题，N皇后放置过程的现实。
由八皇后问题扩展开来，在N*N的棋盘上摆放N个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上。求可能的解决方案，并显示每一种解决方案的皇后放置过程。-N Queen' s problem, N Queen placed the reality of the process. Expansion by opening eight to question Queen' s, at the N* N chessboard placed on a Queen N, making it unable to attack each other, that is, two Queen' s can not be arbitrary in the same line, same column or on the same diagonal. Seek possible solutions, and show a solution for each place of the Queen' s course.
Platform: |
Size: 9216 |
Author: xiafan |
Hits:
Description: 采用递归回溯算法求解N皇后问题；C语言实现，可以动态控制皇后数量-Backward recursive algorithm using N Queen' s problem C language implementation, you can dynamically control the number of Queen' s
Platform: |
Size: 1024 |
Author: yangxh |
Hits:
Description: 分别用面向过程、面向对象和函数式程序设计的方法解决八皇后问题。
附报告-Were process-oriented, object-oriented programming and function of the eight Queen' s problem to solve. The attached report
Platform: |
Size: 206848 |
Author: 邵震 |
Hits:
«
1
2
3
4
56
7
8
9
10
...
50
»