Location:
Search - bahuanghou
Search list
Description: 八皇后的源程序代码-8 Queen of the source code
Platform: |
Size: 973 |
Author: 刘炜 |
Hits:
Description: 该问题主要用于解决八皇后问题。会下国际象棋的人都很清楚：皇后可以在横、竖、斜线上不限步数地吃掉其他棋子。如何将8个皇后放在棋盘上（有8*8个方格），使它们谁也不能被吃掉！这就是著名的八皇后问题。
Platform: |
Size: 3866 |
Author: 李利 |
Hits:
Description: 这是一个八皇后问题，是用C++做的，在编程问题里面还是相当经典的一个
Platform: |
Size: 36993 |
Author: 黄荣 |
Hits:
Description: 数据结构常用算法，用vc++实现的八皇后问题
Platform: |
Size: 1206 |
Author: mm |
Hits:
Description: 一个用C语言编写的八皇后的排列问题
是课程设计
Platform: |
Size: 56651 |
Author: 张涛 |
Hits:
Description: 八皇后问题：我们都知道，在国际象棋里，皇后这子实在忒强了，能横走竖走，还能斜走，
现在我们手头有一个国际象棋棋盘（和二维数组很像啊），还有八个皇后（也许我们可以用‘Q’来表示）
现在我们把八个皇后放在棋盘上，条件是：八个皇后不能互吃，也就是说，不能有两个皇后在
同一行或同一列或同一斜线上！
Platform: |
Size: 38218 |
Author: libo |
Hits:
Description: 八皇后的一个小游戏的c语言实现，有空可以下了看看。
Platform: |
Size: 1047 |
Author: ren |
Hits:
Description: 八皇后的源程序代码-8 Queen of the source code
Platform: |
Size: 1024 |
Author: 刘炜 |
Hits:
Description: 该问题主要用于解决八皇后问题。会下国际象棋的人都很清楚：皇后可以在横、竖、斜线上不限步数地吃掉其他棋子。如何将8个皇后放在棋盘上（有8*8个方格），使它们谁也不能被吃掉！这就是著名的八皇后问题。-The problem is mainly used to solve the issue of the eight Queen
Platform: |
Size: 4096 |
Author: 李利 |
Hits:
Description: 这是一个八皇后问题，是用C++做的，在编程问题里面还是相当经典的一个-This is an eight-Queen s problem is with C++ Done in the programming problem which is still quite a classic
Platform: |
Size: 36864 |
Author: |
Hits:
Description: 数据结构常用算法，用vc++实现的八皇后问题-Data structure commonly used algorithms, with vc++ Realize the eight queen problem
Platform: |
Size: 1024 |
Author: mm |
Hits:
Description: 一个用C语言编写的八皇后的排列问题
是课程设计-A language with C s arrangement of the eight issues of curriculum design
Platform: |
Size: 56320 |
Author: 张涛 |
Hits:
Description: 八皇后问题：我们都知道，在国际象棋里，皇后这子实在忒强了，能横走竖走，还能斜走，
现在我们手头有一个国际象棋棋盘（和二维数组很像啊），还有八个皇后（也许我们可以用‘Q’来表示）
现在我们把八个皇后放在棋盘上，条件是：八个皇后不能互吃，也就是说，不能有两个皇后在
同一行或同一列或同一斜线上！
-8 Queen s problem: We all know that in chess, the Queen is the sub-themis strong, and can go vertical cross walk, but also inclined walk, and now we do have a chess board (and two-dimensional array like ah), There are eight Queen (Maybe we can use Q to show that) now we have eight Queen on the chessboard, on the condition that: Eight Queen s can not eat each other, that is, can not have two Queen s in the same row or the same on the same row or slash!
Platform: |
Size: 209920 |
Author: libo |
Hits:
Description: 八皇后的一个小游戏的c语言实现，有空可以下了看看。-8 Queen
Platform: |
Size: 1024 |
Author: ren |
Hits:
Description: 八皇后了看见发 疯狂数据分类开始减肥凯撒福建考生独立开发就-8 Queen of the data classification to see the beginning of crazy-fat diet Caesar Fujian candidates on the independent development
Platform: |
Size: 506880 |
Author: wanganxiang |
Hits:
Description: 八皇后经典算法 包括回溯和枚举两种方法
八皇后经典算法 包括回溯和枚举两种方法-8 Queen
Platform: |
Size: 2048 |
Author: sunmiaoa |
Hits:
Description: 八皇后问题解，功能详见程序，我在网上找的-8 Queen s problem solution, functions as detailed in the procedure, I find the online
Platform: |
Size: 13312 |
Author: 王文江 |
Hits:
Description: 一个解决了一个数学难题的精典C++小游戏、欢迎您的上载。-A solution of a classical mathematical problems C++ Game, you are welcome to upload.
Platform: |
Size: 514048 |
Author: flyming |
Hits:
Description: 八皇后问题，能过正确解答出八皇后问题的解 共有52个 好像-8 Queen s problem, to have the correct answers to eight the solution s total of 52 seems to
Platform: |
Size: 1024 |
Author: zstill |
Hits:
Description: 题目：八皇后问题。
八皇后问题是指求解如何在国际象棋8*8棋盘上无冲突的放置八个皇后棋子。因为在国际象棋里，皇后的移动方式是横竖交叉，所以在任意一个皇后所在的位置的水平，竖直和斜45度都不能有其他棋子的存在。一个完整的无冲突的八皇后棋子分布成为八皇后问题的一个解。设计思路：我使用了回溯的方法来解决八皇后问题，也就是逐次试探的方法。这个方法是通过函数putchess()对自身的递归调用来实现的。运行程序后，主函数调用putchess()函数在棋盘第一行第一列上放置棋子，开始向下一行递归。每一步的递归中，首先检测待放位置有没有冲突出现，如果没有冲突，就放下棋子，并进入下一行递归，否则检测该行的下一个位置。如果整个一行中都没有可以放置的位置，就退回上一层递归。最后，如果本次放置成功，并且递归调用深度为7，就打印输出结果。-Title: Queen s eight questions.
Queen s eight questions refer to how to solve the 8* 8 chess board placed on the eight conflict-free Queen s pawn. Since at chess, the Queen of the mobile means are横竖cross, so at any one location s level, vertical and inclined 45 degrees can not have other pieces exist. A complete conflict-free distribution of the eight Queen s pawn to become queen eight questions a solution. Design ideas: I use a retrospective method to solve the eight Queen s question, that is, successive test method. This method is through the function putchess () recursive calls of their own to achieve. After running the program, the main function call putchess () function at the first line of the first column of the chessboard placed on a pawn down and his party start recursion. Every step of the recursion, the first question put Detect location appears there is no conflict, if there is no conflict, it is down a pawn, and into the next line recursive, otherwise detect the locatio
Platform: |
Size: 30720 |
Author: cl |
Hits: