Location:
Search - queen
Search list
Description: 八皇后是个古老而有趣的游戏，是由高斯于1850年首先提出的。
要求在国际象棋的棋盘上放置八个皇后，使其不能相互攻击，即任意两个皇后不能处于
棋盘的同一行、同一列和同一条对角线上。试问有多少种放法？-Eight Queens is an old and interesting game, by Gauss in 1850 first proposed. Requirements in place on the chess board eight queen, it can not attack each other, that any two queens can not board the same line in the same column and with a diagonal. How many kinds of put method?
Platform: |
Size: 6144 |
Author: bryce |
Hits:
Description: 该程序是一个实现查找八皇后的问题求解的程序，在vc 中编写的-this program is write for eight queen
Platform: |
Size: 868352 |
Author: 艾永坤 |
Hits:
Description: N皇后的C#实现，可以自定义输入皇后数，并智能显示出皇后的N中方案。-N-Queens of the C# implementation, you can customize the number of input Queen, and the N-smart show in Queen s program.
Platform: |
Size: 2082816 |
Author: xiam |
Hits:
Description: 这是一个关于8皇后的源代码，是用C语言开发，会输出92中结果。-This is a 8 Queen' s source code is written in C language development, will result in the output 92.
Platform: |
Size: 2866176 |
Author: |
Hits:
Description: 八皇后问题19世纪著名的数学家高斯于1850年提出的。他的问题是：在8*8的棋盘上放置8个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列、同一斜线上。请设计算法打印所有可能的摆放方法。-8 queens problems in the 19 th century famous mathematician gauss put forward in 1850. His problem is: in 8* 8 board placed eight queen, to make it can t attack each other, that is, any two queen can in the same line, the same column, the same diagonal lines. Please print all the design algorithm may put method.
Platform: |
Size: 882688 |
Author: fairy |
Hits:
Description: 八皇后问题及n皇后问题求解,数据结构的经典算法，及课程设计的需要-eight queen problem .data sructment problem
Platform: |
Size: 131072 |
Author: 张頔 |
Hits:
Description: 在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。
你的任务是，对于给定的N，求出有多少种合法的放置方法。
-In N* N checkerboard of placed N a queen, so they don t attack each other (that is, any two queen not allowed in the same row, the same listed, and not allowed to board a border in 45 Angle on the diagonal lines.
Your task is for a given N, find out how many kinds of legal placed method.
Platform: |
Size: 1024 |
Author: ren_xi |
Hits:
Description: 用MFC实现八皇后问题，可多皇后，比如四皇后、十六皇后等，可通过输入参数实现-Using MFC to solve eight queens problem, and more Queen, for example four Queens, sixteen Queen, etc., can be achieved through the input parameters
Platform: |
Size: 228352 |
Author: 萱萱 |
Hits:
Description: 八皇后问题。利用了递归算法，很是巧妙！最后一行为输出解的个数，每行共8个数字，这些数字即代表皇后在该行的位置。-It s a code about Eight queen.
Platform: |
Size: 1024 |
Author: 洛菲雨 |
Hits:
Description: 解决N皇后问题，里面有不同方法的分析，还有上限，我记得是100个-Sovle the "n queen" problem
Platform: |
Size: 4096 |
Author: 刘梓祥 |
Hits:
Description: code for 8-queen with c++ language
Platform: |
Size: 1024 |
Author: houri |
Hits:
Description: n后问题演示程序，算法分析与设计，递归算法-N queen problem demonstration program, the algorithm analysis and design, recursion algorithm
Platform: |
Size: 4096 |
Author: jade |
Hits:
Description: 回溯算法解决皇后问题 回溯算法解决皇后问题-the solution of n queen
Platform: |
Size: 1024 |
Author: wang |
Hits:
Description: 用c++实现n皇后的算法源码，注释比较详细，用回溯算法实现的-N queen algorithm source code with c++, a more detailed annotation, backtracking algorithm to achieve
Platform: |
Size: 1024 |
Author: waynechan |
Hits:
Description: 基于MPI的8皇后问题源代码.需要MPI支持-8-queen problem, with MPI
Platform: |
Size: 3072 |
Author: andy |
Hits:
Description: VC++课程设计的八皇后问题
在一个8*8的棋盘上放置彼此不受攻击的8个皇后。
按照国际象棋的规则，皇后可以攻击与之处在同一行或同一列或同一斜线上的棋子。8皇后问题就等价于在8*8格的棋盘上放置8个皇后，任何两个皇后不放在同一行或同一列或同一斜线上。
-VC++ curriculum design the eight queens problem in an 8* 8 chessboard placed 8 Queen not to attack each other. In accordance with the rules of chess, the Queen can attack with in the same row or a pawn in the same column or diagonal. The eight queens problem is equivalent to the eight queens be placed in the 8* 8 grid on the board, no two queens on the same row or column or the same diagonal.
Platform: |
Size: 322560 |
Author: 胡凯 |
Hits:
Description: 解决n皇后问题 利用回溯算法
n后问题等于在n×n格的棋盘上放置n个皇后，任何2个皇后不放在同一行或同一列或同一斜线上。即规定每一列放一个皇后，不会造成列上的冲突；当第i行被某个皇后占领后，则同一行上的所有空格都不能再放皇后，要把以i为下标的标记置为被占领状态。用回溯法解n后问题，用完全n叉树表示解空间。可行性约束Place剪去不满足行，列和斜线约束的子树。从根节点出发搜索解空间树。算法搜索至空间树的任何一结点时，先判断该点是否包含问题的解。如果肯定不包含，则跳过对以该结点为根的子树的搜索，逐层向其祖先结点回溯；否则进入该子树，继续深度优先策略搜索。-with this solve n queen problem
fasdfsd asdfdasfas f asdfasf asf
Platform: |
Size: 1024 |
Author: yuts |
Hits:
Description: 求解n皇后问题。给定一个N×N的棋盘，在棋盘上放置N个皇后，使得N个皇后两两之间互不攻击。任何两个处于同一列，同一行，同一对角线上的皇后都会互相攻击。
-Solve the n queens problem. To set a NN board, place N queens on a chessboard, making the N-queens do not attack each other between every two. Any two in the same column, same row, the Queen will attack each other on the same diagonal.
Platform: |
Size: 1024 |
Author: liao |
Hits:
Description: 基于Erlang语言平台解决N皇后问题,通过对原有基于Erlang的N皇后问题算法进行分析，提出了一种新的改进算法。该算法利用位运算操作，并且在每一行只搜索可以放置皇后的位置。通过理论分析与实验验证，证明该算法能明显提升N皇后问题算法效率。-Solve the N-queens problem, based on the Erlang language platform through the original N-queens problem algorithm based on Erlang analysis, a new improved algorithm. The algorithm uses the bitwise operations, and search only the Queen' s position can be placed in each row. Show that this approach can significantly enhance the efficiency of the N-queens problem algorithm through theoretical analysis and experimental verification.
Platform: |
Size: 233472 |
Author: 陈嘉鑫 |
Hits:
Description: ： N皇后问题，在一个N×N国际象棋盘
上，有N个皇后，每个皇后占一格；要求皇后间不会出现
相互“攻击”的现象，即不能有两个皇后处在同一行、同一
列或同一对角线上。问共有多少种不同的方法。下图以4
个皇后为例，说明一个正确的解（ N是一个大于等于2并
且小于等于100的整数）-: N queens problem, a NN chess disk, N-Queen, Queen of the grid requirements between each other " attack" phenomenon does not appear in the Queen' s, that can not have two queens in the same row , the same column or on the diagonal. Asked a total of a number of different ways. The following diagram 4 Queen, for example, indicating that a correct solution (N is a number greater than or equal to 2 and less than or equal to an integer of 100)
Platform: |
Size: 2048 |
Author: 邹继瑶 |
Hits:
«
1
2
...
4
5
6
7
8
910
11
12
13
14
...
50
»