Welcome![Sign In][Sign Up]
Location:
Search - Nhuanghou

Search list

[OtherNhuanghou

Description: 皇后问题的求解,你可以求3个或4个或5个,六个-Queen problem solving, you can help three or four or five, six, etc.
Platform: | Size: 1184 | Author: 刘发 | Hits:

[Other resourcenhuanghou

Description: 八皇后问题是大数学家高斯于1850年提出来的。该问题是在8×8的国际象棋棋盘上放置8个皇后,使得没有一个皇后能\"吃掉\"任何其他一个皇后,即没有任何两个皇后被放置在棋盘的同一行、同一列或同一斜线上。要求编一个程序求出该问题的所有解。骑士游历问题是放在8×8的国际象棋棋盘上的一个马,按照马走\"日\"字的规则是否能够不重复地走遍棋盘的每个格。要求编一个程序求出该问题的一个解。
Platform: | Size: 1954 | Author: 夏鑫 | Hits:

[Othernhuanghou

Description:  在N*N的棋盘上,放置N个皇后,要求每一横行,每一列,每一对角线上均只能放置一个皇后,求可能的方案及方案数。
Platform: | Size: 4138 | Author: 高飞 | Hits:

[OtherNhuanghou

Description: 皇后问题的求解,你可以求3个或4个或5个,六个-Queen problem solving, you can help three or four or five, six, etc.
Platform: | Size: 1024 | Author: 刘发 | Hits:

[Data structsnhuanghou

Description: 八皇后问题是大数学家高斯于1850年提出来的。该问题是在8×8的国际象棋棋盘上放置8个皇后,使得没有一个皇后能"吃掉"任何其他一个皇后,即没有任何两个皇后被放置在棋盘的同一行、同一列或同一斜线上。要求编一个程序求出该问题的所有解。骑士游历问题是放在8×8的国际象棋棋盘上的一个马,按照马走"日"字的规则是否能够不重复地走遍棋盘的每个格。要求编一个程序求出该问题的一个解。-Eight Queen s question is the main mathematician Gauss was put forward in 1850. The problem is in the 8 × 8 chess board to place eight queen, making no one s able to eat any other a queen, that is, no two queen was placed in the chessboard of the same line, the same row or the same oblique online. Asked for a procedure to derive all the solutions of the problem. The problem is Cavalier traveled on 8 × 8 chess board on a horse, in accordance with the horse to the Day of the rules of the word can not be repeated for each cell traveled chessboard. Asked for a procedure to derive a solution of the problem.
Platform: | Size: 2048 | Author: 夏鑫 | Hits:

[Othernhuanghou

Description:  在N*N的棋盘上,放置N个皇后,要求每一横行,每一列,每一对角线上均只能放置一个皇后,求可能的方案及方案数。-In the N* N chessboard, place N of Queen
Platform: | Size: 4096 | Author: 高飞 | Hits:

[Windows Developnhuanghou

Description: n皇后问题啊 我这个是8皇后的 算法比别人的简单点儿 相信你会看懂哦 !-n Queen
Platform: | Size: 2048 | Author: haha | Hits:

[Data structsnhuanghou-c

Description: 皇后问题,解法也是多种,目前主要有回溯,递推两种方法-Queen' s issue, is also a wide range of solutions, the current major retrospective, recursive methods
Platform: | Size: 1024 | Author: li shu | Hits:

[Mathimatics-Numerical algorithmsnhuanghou

Description: 一个N后的问题C的解决方案,高手们就不用过目了,呵呵,新手们可以参考修改下-N C after a solution to the problem, they do not have to look over the master, Oh, they can refer to the revised and novice
Platform: | Size: 177152 | Author: 杨飞宇 | Hits:

[Data structsnhuanghou

Description: n皇后问题解法,最典型的是8皇后,用于递归回溯法的经典案例。-n queens solution, the most typical is 8 Queen, for a classic example of a recursive backtracking.
Platform: | Size: 105472 | Author: 刘冰淇 | Hits:

[CSharpNhuanghou

Description: 这是我自己做的N皇后实验,是一个小型的学生信息管理小系统,供新手学习-This is my own N Queen experiments, a small student information management system for the novice to learn
Platform: | Size: 50176 | Author: 阿克瓦力 | Hits:

[OtherNhuanghou

Description: 这是一个经典8皇后问题的拓展,将其推广到N皇后,病输出所有结果。-This is a classic 8 queens problem expansion will be extended to the N-Queens disease output results.
Platform: | Size: 1024 | Author: 鼠标 | Hits:

[Data structsnHuangHou

Description: 队列式分支界限法实现的n皇后问题,采用文件的方式输入输出-Queue-type branch and bound method to achieve the n-queens problem, using the method of file input and output
Platform: | Size: 1024 | Author: 黄东浪 | Hits:

[source in ebookNhuanghou

Description: N皇后问题,输入N就可以展示出每一种情况以及情况总数-N queens problem, enter N can demonstrate in each case as well as the total number of cases
Platform: | Size: 1024 | Author: 韦开仁 | Hits:

CodeBus www.codebus.net