Location:
Search - queen
Search list
Description: 八皇后问题是一个古老而著名的问题，是回溯算法的典
型例题。该问题是十九世纪著名的数学家高斯1850 年提出：
在8X8 格的国际象棋上摆放八个皇后，使其不能互相攻击，
即任意两个皇后都不能处于同一行、同一列或同一斜线上，
问有多少种摆法。-eight Queen's problem is an ancient and famous, is backtracking algorithm typical examples. The question is the famous 19th century mathematician Gauss 1850 : 8 X8 in the lattice placed on the international chess 8 Queen's, making it unable to attack each other. arbitrary or two at Queen's are not the same line, the same series or in the same slash and asked how many pendulum method.
Platform: |
Size: 145408 |
Author: xiaowu |
Hits:
Description: 皇后控制问题 皇后控制问题-Queen
Platform: |
Size: 226304 |
Author: hsw |
Hits:
Description: 使用回溯递归法实现的八皇后问题的算法源码-Backward recursive method used to achieve the eight-queen problem algorithm source code
Platform: |
Size: 2048 |
Author: 方西 |
Hits:
Description: 用遗传算法解决八皇后问题！
有比较详细的注释！
还有有关遗传算法理论的描述。
-Using genetic algorithms to solve the issue of the eight Queen
Platform: |
Size: 23552 |
Author: |
Hits:
Description: 经典8皇后问题程序,在vc6.0运行通过-8 Queen
Platform: |
Size: 352256 |
Author: 张二 |
Hits:
Description: 实现了皇后问题，还有计算表达式的问题，都是有关迭代的典型算法-Realize the Queen
Platform: |
Size: 561152 |
Author: 李泰成 |
Hits:
Description: 四皇后问题
在4×4的方格上，摆放四个皇后，其中任两个皇后均不能在同一直线或对角线上，问有多少种摆法-Four Queen
Platform: |
Size: 35840 |
Author: |
Hits:
Description: n皇后问题求解(8<=n<=1000)
a) 皇后个数的设定
在指定文本框内输入皇后个数即可,注意: 皇后个数在8和1000 之间(包括8和1000)
b) 求解
点击<Solve>按钮即可进行求解.
c) 求解过程显示
在标有Total Collision的静态文本框中将输出当前棋盘上的皇后总冲突数.
当冲突数降到0时,求解完毕.
d) 求解结果显示
程序可以图形化显示8<=n<=50的皇后求解结果.
e) 退出程序,点击<Exit>即可退出程序.-n Queens Problem Solving (8 <= n <= 1000) a) Queen number of settings in the designated text box to enter the Queen s Number, Note: Queen s number in between 8 and 1000 (including 8 and 1000) b) Solving <Solve> Click button to solve. c) the solution process displayed in the Total Collision marked the static text box will output the current Queen s chessboard the total number of conflicts. When the conflict reduced the number of 0:00, finished solving. d) The results showed that the procedure can solve the graphical display 8 <= n <= 50 to solve the results of the Queen. e) withdraw from the program, click <Exit> to withdraw from the program.
Platform: |
Size: 128000 |
Author: jiangtao |
Hits:
Description: N皇后问题的实现，采用JFace做界面，可以方便地计算N皇后问题-N Queen
Platform: |
Size: 2048 |
Author: yus |
Hits:
Description: 八皇后问题的一种使用递归的解法，对学习递归者有一定参考作用-8 Queen s problem using a recursive method, recursive learning have a certain reference
Platform: |
Size: 280576 |
Author: VicentGuo |
Hits:
Description: 用MFC实现的可视化N皇后问题演示程序，可按皇后数动态调整棋盘大小，可逐个观察所有可行解。-Using MFC to achieve Visualization Demonstration Program N Queen s problem can be dynamically adjusted number of Queen s board size, can be observed by all the feasible solution.
Platform: |
Size: 22528 |
Author: Diana |
Hits:
Description: 求解八皇后问题
求解八皇后问题 -Solving Problem Solving 8 8 Queen s problem
Platform: |
Size: 2048 |
Author: 陈扬扬 |
Hits:
Description: n皇后问题的C语言实现,有图形界面的,非常之经典的程序,用的是回溯法-n s C language issues, there are graphical interface, and very classic procedure, using a backtracking
Platform: |
Size: 27648 |
Author: wen |
Hits:
Description: 用JAVA编写的N后问题~可以自由设置皇后个数，目前设置皇后上限为13，更改程序中STRING字符串的大小后可计算更多皇后的问题，有图形化界面显示解的位置~界面很可爱好看的哦~ -JAVA prepared with N, after the issue of ~ can freely set the number of Queen s, Queen s currently set a maximum of 13, to change the program the size of the string STRING after more Queen computable problems, have a graphical user interface shows the location of ~ interface solution is Oh pretty cute ~
Platform: |
Size: 66560 |
Author: ling |
Hits:
Description: 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-8 Queen s problem is an ancient and well-known problems, backtracking algorithm is a typical example. The problem is that the nineteenth century, the famous mathematician Gauss in 1850: Under the 8x8 grid on the display of the chess Queen eight, making it unable to attack each other, that is, any two can not be Queen s in the same line, the same row or the same slash on, asking how many kinds of pendulum method.
Platform: |
Size: 9216 |
Author: 何再兴 |
Hits:
Description: 局部搜索法求解N皇后问题。这个算法的特点是引入随机因素，每次运行并不能保证求得问题的最优解，但经过运行之后，一般总能得到一个与最优解相差不大的满意解。-Local Search Method for Solving N Queens problem. The algorithm is characterized by the introduction of random factors, each running and can not guarantee to achieve the optimal solution of the problem, but after running, the general always be an optimal solution is no less than satisfactory solution.
Platform: |
Size: 1024 |
Author: 清和信平 |
Hits:
Description: 经典八皇后问题——数据结构课程设计报告,虽然好多地方都有，我这个是按老师要求做好的，加个封面就可以直接上交。-Queen s classic eight questions- data structure of the curriculum design report, although a lot of places, I this is based on the teacher asked to do a good job, and add the cover can be directly handed over.
Platform: |
Size: 105472 |
Author: 贾名 |
Hits:
Description: 用面向对象的观点考虑和设计了八皇后问题，其中皇后位置的判断由皇后自己进行冲突检查。-Object-oriented point of view to consider and design of the eight Queen s, which the judge s position to conduct the conflict by the Queen s own inspection.
Platform: |
Size: 1024 |
Author: zhengcuiling |
Hits:
Description: 八皇后问题的完整实现，运行正常，结果正确-8 Queen s complete realization of operating normally, the results of the correct
Platform: |
Size: 5120 |
Author: eric |
Hits:
Description: 遗传算法与回朔法对比 解决n皇后问题c源码-Genetic Algorithms and retrospective comparison method to resolve the issue of n queen c source
Platform: |
Size: 8192 |
Author: huli |
Hits:
«
1
2
34
5
6
7
8
9
10
...
50
»