搜索资源列表
N-quenes-problem
- N皇后问题,本程序采用二维数组处理N皇后问题,可由用户在运行过程中决定棋盘规格及皇后数目。-N queens problem, the program uses a two-dimensional array processing N-queens problem, decide the number of board specifications and Queen by the user during operation.
code
- 使用回溯法解决的典型问题的算法:骑士巡游问题,n皇后问题,0-1背包问题。 使用递归与分治策略解决的几个问题的算法:Hanoi塔问题和二分搜索技术。-Uses backtracking method to solve the problems of the typical algorithms: the knight tour problem, n queen problem, 0-1 knapsack problem. Recursion and divide and conq
queen
- N皇后问题(含八皇后问题的扩展,规则同八皇后):在N*N的棋盘上,放置N个皇后,要求每一横行每一列,每一对角线上均只能放置一个皇后,问可能的方案及方案数。-queen question
eightqueen
- N后问题,利用OPENGL实现简单演示。-N queen problem. using opengl for simple display.
Nqueen_Backtracking
- N queen Backtracking 算法N皇后问题的的回溯实现算法-N queen Backtracking Algorithm N Queen s problem of the realization of the backtracking algorithm
main
- N皇后问题,本代码使用了图文试的棋盘输出,可动态学习N皇后的问题的解法。-N queen problem, try this code USES graphic board output, dynamically study N queen problem solutions.
nQueen
- n皇后的回溯算法实现及多边形求和的动归实现。-n Queen backtracking algorithm and the sum of dynamic polygon return achieved.
NQueens
- Implement N Queen’s problem using Back Tracking.
queen
- N皇后问题是算法中回溯法应用的一个经典案例 回溯算法也叫试探法,它是一种系统地搜索问题的解的方法。回溯算法的基本思想是:从一条路往前走,能进则进,不能进则退回来,换一条路再试。 -N queens problem is backtracking algorithm applied a classic case of backtracking algorithm, also called heuristics, which is a systematic method for solvi
The-queen
- 实现N个皇后问题,输出所有的排列情况,利用TXT实现输入输出-Realization of N-queens problem, the output of all of the arrangement, the use of input and output TXT achieve
queen
- 局部搜索的方法实现n皇后问题,在较快的时间内找到一个n皇后解。-Local search methods to achieve n queens problem and find a solution in n-queens faster time.
N_QUEENR
- 读入一个值n表示棋盘的大小,然后求出n*n格棋盘上放n皇后棋且不会相互吃掉对方的所有解答-Reading into a value of n, said the size of the chessboard, and then calculated n* n chessboard grid put n Queen s chess and will not eat each other all the answers
Queen
- n*n的棋盘上放置彼此不受攻击的n个皇后,按国际象棋规则可知:皇后可以攻击同行同列同斜线的棋子-n* n chessboard placed on each other from attack of the n-Queens, according to chess rules we can see: Queen can attack the peer-pawn with the column with a slash
huanghou
- 用回溯法求解N-Queen,用键盘输入N;输出此时解的个数,并统计运算时间。 -Solved by backtracking N-Queen, with keyboard input N the number of solutions of output at this time, and statistical computation time.
queen
- 实现n皇后问题,采用回溯方法简单解决。 有详细注释,适合初学者学习。-Achieve n-queens problem using backtracking method is simple to solve. There are detailed notes, suitable for beginners to learn.
N-queens-problem
- 八皇后问题是一个古老而著名的问题,是回溯算法的经典问题。该问题是十九世纪著名的数学家高斯在1850年提出的:在8*8的国际象棋棋盘上,安放8个皇后,要求没有一个皇后能够“吃掉”任何其它一个皇后,即任意两个皇后不能处于同一行,同一列或者同一条对角线上,求解有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解,后来有人用图论的方法得到结论,有92中摆法。 本实验拓展了N皇后问题,即皇后个数由用户输入。 -Eight queens problem
Matlab-file
- SA algorithm for solving n-Queen problem
climb_mountain
- 爬山算法实现n皇后问题,实现速度快,一分钟内可实现n为百万的规模。而且增加了新功能,即对角线上不能存在皇后。-n-queen problem by climbing mountain
nQueen
- 利用回溯法实现n皇后问题,代码简洁易懂,运行速度快,且有注释-Backtracking method is used to realize the n queen problem, understandable code, run fast, and there are comments
1
- N-皇后问题,利用回溯算法遍历求出能放置的位置方法。-N- queen problem, the use of backtracking algorithm traverse method can take the place of location.