Location:
Search - n后问题
Search list
Description: 在 n 行 n 列的国际象棋棋盘上，最多可布n个皇后。
若两个皇后位于同一行、同一列、同一对角线上，则称为它们为互相攻击。
n皇后问题是指找到这 n 个皇后的互不攻击的布局。
n 行 n 列的棋盘上，主次对角线各有2n-1条。-n n trip out of the international chess board, the maximum n Queen's cloth. If two at the same Queen's visit, the same series on the same diagonal, as they attack each other. N Queen's problem is found n the Queen not to attack each other's layout. N n trip out on the chessboard, and secondary diagonal each 2n-1.
Platform: |
Size: 1384 |
Author: 刘二 |
Hits:
Description: n皇后问题
Platform: |
Size: 9447 |
Author: cocker |
Hits:
Description: n后问题回溯法解决
Platform: |
Size: 1628924 |
Author: xiaohu100910 |
Hits:
Description: 算法中的n后问题,用非递归实现的，用一般的c++编译器都可以实现-n algorithm after issue, the non- recursive with the general c compiler can achieve
Platform: |
Size: 1024 |
Author: 鸡蛋 |
Hits:
Description: n皇后问题，可以显示所有的合适路径，典型的回溯算法-n Queen's, will show you all the appropriate path, the typical backtracking algorithm
Platform: |
Size: 9216 |
Author: 吴限负 |
Hits:
Description: 在 n 行 n 列的国际象棋棋盘上，最多可布n个皇后。
若两个皇后位于同一行、同一列、同一对角线上，则称为它们为互相攻击。
n皇后问题是指找到这 n 个皇后的互不攻击的布局。
n 行 n 列的棋盘上，主次对角线各有2n-1条。-n n trip out of the international chess board, the maximum n Queen's cloth. If two at the same Queen's visit, the same series on the same diagonal, as they attack each other. N Queen's problem is found n the Queen not to attack each other's layout. N n trip out on the chessboard, and secondary diagonal each 2n-1.
Platform: |
Size: 1024 |
Author: 刘二 |
Hits:
Description: 用分支界限法实现的n后问题 vc++ 语言效率很好-branch line with the law to achieve n vc language problem after a good efficiency
Platform: |
Size: 2066432 |
Author: 郝永生 |
Hits:
Description: 算法设计:著名的n后问题:在nXn的棋盘上放彼此不受攻击的n个皇后,按国际象棋的规则,任何2个皇后不在同一行或同一列或同一斜线上.
本算法才用回朔法来解决.-algorithm design : n after the famous question : In nXn put on the chessboard of each other against attack n empress, according to the international rules of chess, any two Queen's not the same line, or in the same series or slash on the same. the algorithm used the method to solve the Schomburg.
Platform: |
Size: 251904 |
Author: 王涛 |
Hits:
Description: n后问题回溯(递归)
C/C++编写的n后问题回溯(递归)
欢迎大家使用，给大家带来愉快的心情-problems after n retrospective (recursive) C/C n prepared by the issue after backtracking (recursive) Everyone is welcome to use. give us some pleasant mood
Platform: |
Size: 582656 |
Author: 杨文博 |
Hits:
Description: n后问题，主要是算法问题，有java改写-after issue, the main issue is the algorithm, rewritten java
Platform: |
Size: 36864 |
Author: 胡小川 |
Hits:
Description: 1. 编写求n后问题的通用函数；
2. 取n=8计算出n后问题的所有可行解，并以8元组的形式输出（可以对可行解的结构进行分析，）；
3. 随机输出2个可行解的图形。其中棋盘要有8×8的格子，Queen图象自选；
-1. To prepare for issues common after n function 2. Take n = 8 calculated after n all feasible solution, and 8-byte form of output (can be a feasible solution of the structure analysis) 3. Random output of two feasible solution graphics. Which must be 8 × 8 chessboard lattice, Queen images on-demand
Platform: |
Size: 49152 |
Author: |
Hits:
Description: 利用java编程
1. 编写求n后问题的通用函数；
2. 取n=8计算出n后问题的所有可行解，并以8元组的形式输出（可以对可行解的结构进行分析，）；
3. 随机输出2个可行解的图形。其中棋盘要有8×8的格子，Queen图象自选；
-Using java programming 1. To prepare for issues common after n function 2. Take n = 8 calculated after n all feasible solution, and 8-byte form of output (can be a feasible solution of the structure analysis) 3. random output 2 feasible solution graphics. Which must be 8 × 8 chessboard lattice, Queen images on-demand
Platform: |
Size: 132096 |
Author: |
Hits:
Description: n后问题,有界面。
-after question, it is the interface.
Platform: |
Size: 185344 |
Author: zhanag |
Hits:
Description: n后问题,实现n后问题的求解,并且可以输出最有解-n, n after realizing the problem solving, and can export most Solution
Platform: |
Size: 245760 |
Author: 李真志 |
Hits:
Description: 这是一个用c++实现的n后问题，利用回溯法，并以深度优先搜索的方法，进行求解，程序中由用户输入n值确定是几后问题，打出所有的解。-This is a used c++ Achieved after n problem, the use of backtracking, and depth-first search method to solve process n value is entered by the user to determine several issues, making all solutions.
Platform: |
Size: 212992 |
Author: liu fei |
Hits:
Description: 这是一个用C语言写的禁忌搜索算法的解释，解决了了一个n后问题，这是一个典型的介绍性的算法代码。
很不错-err
Platform: |
Size: 1401856 |
Author: guoguo |
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: n后问题的代码，最后用图形显示，运用了多线程技术-n after the issue of the code, and finally with graphical display, using a multi-threading technology
Platform: |
Size: 41984 |
Author: 屈伟 |
Hits:
Description: n后完整代码以及解释。采用回溯算法进行求解，在搜索的过程中，将不满足条件要求的分支树剪去，可以有效的降低算法的时间复杂性。(Complete code and interpretation after n.)
Platform: |
Size: 63488 |
Author: DAWNMING |
Hits:
« 12
3
4
5
6
7
8
9
10
...
16
»