Location:
Search - 8huanghou
Search list
Description: 八皇后问题是一个古老而著名的问题。这个问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。例如:
0
0
0
0
0
0
0
0
面对这个问题，要放在以往可能就要耗费大量的时间在纸上画来画去，这样做的耗费了大量的精力，但是效果却不佳。借助计算机就可以很高效的完成这些工作。那么，采用什么样的数据结构和算法，才能在时间和空间复杂度上完成这个问题呢？
-eight Queen's problem is an cient and well-known problems. 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. Gauss that 76 species program. 1854 in Berlin on different chess magazine published by the author of 40 different types of solutions Later, someone using graph theory methods to come up with 92 kinds of results. For example : 0 0 0 0 0 0 0 0 Faced with this problem, to be placed on the past, we might have spent a lot of time on paper painting to painting, so to spend a lot of energy, However, the result is poor. Using computer c
Platform: |
Size: 83654 |
Author: nicmaters |
Hits:
Description: 八皇后问题的C语言递归示例.详见ReadMe-the C language recursive example. See ReadMe
Platform: |
Size: 1695 |
Author: 李权胜 |
Hits:
Description: 算法流程：
１、数据初始化。
２、从n列开始摆放第n个皇后（因为这样便可以符合每一竖列一个皇后的要求），先测试当前位置(n,m)是否等于０（未被占领）：
如果是，摆放第n个皇后，并宣布占领(记得要横列竖列斜列一起来哦)，接着进行递归；
如果不是，测试下一个位置(n,m+1)，但是如果当n<=8,m=8时，却发现此时已经无法摆放时，便要进行回溯。
３、当n>8时，便一一打印出结果。
优点：逐一测试标准答案，不会有漏网之鱼。
Platform: |
Size: 785 |
Author: 高慧 |
Hits:
Description: 数据结果论文,8皇后问题的解决.成品
沈阳大学课程设计
Platform: |
Size: 109540 |
Author: lvming |
Hits:
Description: 运用递归解N皇后问题以及递归问题的研究
Platform: |
Size: 6406 |
Author: liuxuntao |
Hits:
Description: 八皇后问题的C语言递归示例.详见ReadMe-the C language recursive example. See ReadMe
Platform: |
Size: 1024 |
Author: 李权胜 |
Hits:
Description: 八皇后问题是一个古老而著名的问题。这个问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。例如:
0
0
0
0
0
0
0
0
面对这个问题，要放在以往可能就要耗费大量的时间在纸上画来画去，这样做的耗费了大量的精力，但是效果却不佳。借助计算机就可以很高效的完成这些工作。那么，采用什么样的数据结构和算法，才能在时间和空间复杂度上完成这个问题呢？
-eight Queen's problem is an cient and well-known problems. 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. Gauss that 76 species program. 1854 in Berlin on different chess magazine published by the author of 40 different types of solutions Later, someone using graph theory methods to come up with 92 kinds of results. For example : 0 0 0 0 0 0 0 0 Faced with this problem, to be placed on the past, we might have spent a lot of time on paper painting to painting, so to spend a lot of energy, However, the result is poor. Using computer c
Platform: |
Size: 82944 |
Author: nicmaters |
Hits:
Description: 算法流程：
１、数据初始化。
２、从n列开始摆放第n个皇后（因为这样便可以符合每一竖列一个皇后的要求），先测试当前位置(n,m)是否等于０（未被占领）：
如果是，摆放第n个皇后，并宣布占领(记得要横列竖列斜列一起来哦)，接着进行递归；
如果不是，测试下一个位置(n,m+1)，但是如果当n<=8,m=8时，却发现此时已经无法摆放时，便要进行回溯。
３、当n>8时，便一一打印出结果。
优点：逐一测试标准答案，不会有漏网之鱼。
-Algorithm processes: 1, data initialization. 2, from n to start out the first n-place Queen s (because it would be able to meet each vertical column of a Queen s request), first test the current position (n, m) is equal to 0 (not occupied): If yes, before let the first n of Queen s, and announced that the occupation (remember to put out oblique row out together Oh), followed by recursive If not, test the next location (n, m+ 1), but if n <= 8, m = 8, they found that at this time have been unable to display, it should be retroactive. 3, when n> 8, they all print out the results. Advantages: one by one testing standard answer, there will not be falling through the openings.
Platform: |
Size: 1024 |
Author: 高慧 |
Hits:
Description: 数据结果论文,8皇后问题的解决.成品
沈阳大学课程设计-Data papers, 8 Queen
Platform: |
Size: 109568 |
Author: lvming |
Hits:
Description: 运用递归解N皇后问题以及递归问题的研究
-The use of recursive solution of N Queen
Platform: |
Size: 6144 |
Author: liuxuntao |
Hits:
Description: 八皇后问题-8 Queen
Platform: |
Size: 1024 |
Author: yanghui |
Hits:
Description: 在一个8×8国际象棋盘上，有8个皇后，每个皇后占一格；要求皇后间不会出现相互“攻击”的现象，即不能有两个皇后处在同一行、同一列或同一对角线上。问共有多少种不同的方法。
-8 × 8 in a chess set, there are 8 Queen' s, Queen' s share of each cell between Queen will not be asked each other " attack" phenomenon, that is, can not have two Queens in the same line, the same row or the same diagonal. Asked how many different ways.
Platform: |
Size: 4096 |
Author: yishiwucheng |
Hits:
Description: 八皇后问题的一种解决办法，先上传了给大家一点参考-8 Queen' s problem a solution, we first uploaded to the reference point
Platform: |
Size: 1024 |
Author: yjh |
Hits:
Description: 8皇后问题递归解法，输出了所有的有关8皇后问题可能的解法-8 queens problem recursive solution, the output of all of the 8 Queens problem may be related to the solution
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。-Eight queens problem is an old and well-known problem is a typical example backtracking algorithm. The problem is that the nineteenth century the famous mathematician Gauss 1850: Under the 8X8 grid placed eight on the international chess queen, so that it can not attack each other, that any two Queens can not in the same row, same column or the same slash on the question of how many pendulum method.
Platform: |
Size: 1024 |
Author: pudn15a |
Hits:
Description: 八皇后问题是指求解如何在国际象棋8*8棋盘上无冲突地放置八个皇后棋子-8 queenes problem is how to place 8 chess pieces in the 8* 8 board without conflict
Platform: |
Size: 1024 |
Author: 小宋 |
Hits:
Description: 用C++写的八皇后代码，
可以运行成功，其中有随机数-Written in C++ code for the eight queens can be run successfully
Platform: |
Size: 1024 |
Author: 王瑞 |
Hits:
Description: 数据结构与程序设计8皇后程序4-this is 8 kings
Platform: |
Size: 585728 |
Author: 胡骁 |
Hits:
Description: 基于Visual Studio 2005+C#汇编+移动应用开发项目，此项目为八皇后游戏项目-Compiled based on the Visual Studio 2005+C#+ mobile application development projects, this project for the eight queens game project
Platform: |
Size: 26624 |
Author: tom |
Hits:
Description: 八皇后回溯算法C语言的描述，codeblocks下建的工程，算法注释较少，但比较容易懂-Eight Queens backtracking algorithm C language description of the project under construction in the codeblocks, fewer algorithms comment, but relatively easy to understand
Platform: |
Size: 11264 |
Author: 天下 |
Hits: