Location:
Search - ８皇后
Search list
Description: ８皇后问题的所有解，可以把它给成N皇后的问题
Platform: |
Size: 5490 |
Author: dongfengaa |
Hits:
Description: 在一个８×８的棋盘里放置８个皇后，要求每个皇后两两之间不相\"冲\"发现很少有关于C#的算法，这是最近写的一个八皇后的算法我写了很详细的注解。
Platform: |
Size: 6399 |
Author: 潘奇峰 |
Hits:
Description: 本程序为人工智能中较为经典的８皇后问题，采用回朔法实现的-the procedures for Artificial Intelligence eight more classic Queen's, and used to achieve the Schomburg France
Platform: |
Size: 12021 |
Author: 王洪斌 |
Hits:
Description: 在一个８×８的棋盘里放置８个皇后，要求每个皇后两两之间不相"冲"发现很少有关于C#的算法，这是最近写的一个八皇后的算法我写了很详细的注解。-In an 8 × 8 chessboard placed 8 Queen s, Queen s 22 requirements for each phase between the raiding rarely found on the C# The algorithm, which is recently wrote an eight Queen s algorithm I wrote a very detailed comments.
Platform: |
Size: 13312 |
Author: 潘奇峰 |
Hits:
Description: 本程序为人工智能中较为经典的８皇后问题，采用回朔法实现的-the procedures for Artificial Intelligence eight more classic Queen's, and used to achieve the Schomburg France
Platform: |
Size: 407552 |
Author: 王洪斌 |
Hits:
Description: 人工智能中的八皇后问题，使用Ｃ＋＋开发．-８ ｋｉｎｇ
Platform: |
Size: 2048 |
Author: eventh |
Hits:
Description: 5． 8皇后问题
在一个８×８的棋盘里放置８个皇后，要求这8个皇后两两之间互相都不“冲突”。
-5. 8 Queen' s problem in an 8 × 8 chessboard placed 8 Queen' s, 8' s requirement that 22 is not between " conflict."
Platform: |
Size: 149504 |
Author: 松柏长青 |
Hits:
Description: 八皇后问题
〖问题描述〗
在一个８×８的棋盘里放置８个皇后，要求每个皇后两两之间不相"冲"（在每一横列竖列斜列只有一个皇后）。
-8 Queen' s problem〗 〖Description of the problem in an 8 × 8 board in place of the eight Queen' s, Queen' s required for each phase between the 22 " red" (vertical bar shown in each column there is only one Queen oblique).
Platform: |
Size: 3072 |
Author: 宏 |
Hits:
Description: 在一个８×８的棋盘里放置８个皇后，要求每个皇后两两之间不相"冲"-In an 8 × 8 chessboard in place eight queens, requires each inconsistent between Queen 22 " red"
Platform: |
Size: 1024 |
Author: leezizi |
Hits:
Description: 该问题是 19 世纪著名的数学家高斯 1850 年提出的。八皇后问题要求在一个８ × ８ 的 棋盘上放上８个皇后，使得每一个皇后既攻击不到另外 7 个皇后，也不被另外 7 个皇后所攻击。 按照国际象棋的规则， 一个皇后可以攻击与之处在同一行或同一列或同一斜线上的其他任何棋子。 因此， 八皇后问题等于要求 8 个皇后中的任意两个不能被放在同一行或同一列或同一斜线上。 该代码为解决此问题的代码-The problem is that the famous 19th century mathematician Gauss 1850 s. Eight queens problem requires a 8 × 8 chessboard
Put 8 on the Queen, so that each queen attacks both less than seven other queen, nor queen was attacked by the other seven. Press
According to the rules of chess, a queen can attack with them in the same row or column or any other on the same diagonal pieces.
Therefore, the eight queens problem is tantamount to asking eight in any two of the Queen can not be on the same row or same column or the same diagonal.
The code for the code to solve this problem
Platform: |
Size: 200704 |
Author: zzl |
Hits:
Description: 用c++语言平台将一个８＊８的棋盘上放上８个皇后，使得每一个皇后既攻击不到另外七个皇后，也不被另外七个皇后所攻击的92种结构予以实现-In c++ language platform will a 8* 8 board put 8 a queen
Platform: |
Size: 124928 |
Author: 熊伟 |
Hits:
Description: 八皇后问题要求在一个８X８的棋盘上放上８个皇后，使得每一个皇后既攻击不到另外七个皇后，也不被另外七个皇后所攻击-Eight queens problem requirements put eight queens on a 8x8 board, making a queen both attack less than seven other Queen or seven Queen' s attack
Platform: |
Size: 99328 |
Author: ljy |
Hits:
Description: 在一个８×８的棋盘里放置８个皇后，要求每个皇后两两之间不相冲突
（在每一横列，竖列，斜列只有一个皇后）
-In a 88 chessboard, placed eight queens, queens requires each between any two do not conflict (in each row, vertical column, diagonal row only one queen)
Platform: |
Size: 7168 |
Author: 孙涛 |
Hits:
Description: 8皇后问题
在一个８×８的棋盘里放置８个皇后，要求这8个皇后两两之间互相都不“冲突”。-eight queens
Platform: |
Size: 5120 |
Author: 张莹 |
Hits: