搜索资源列表
Nqueenn的C++源码
- 采用c++编写,上机运行通过的N皇后实现代码,绝对可用-used to prepare, on the plane running through the realization of the code N Queen's absolutely available!
eight_huanghou
- 八皇后问题,回溯算法的经典例子,此程序可以扩展至n皇后问题。-eight Queen's problems, backtracking algorithms classic example of this procedure can be extended to n Queen's problem.
算法分析与设计多媒体
- 在毕业设计期间由多人开发的一个算法演示系统,它包n皇后问题、拉维斯加算法等-This is a algorithm demo system developed by some persons, which including n queen problem, Laplac algorithm,etc.
Queen1
- 用JAVA编写的N皇后编码,用回朔法实现,请大家多提提意见-prepared using JAVA N Queen coding method used to achieve Schomburg, please make a suggestion more
N_queue
- 根据回朔法思想来求解N皇后问题,用递归来实现回朔.-Thought to solve N Queen's problems, and use recursion to achieve back Schomburg.
N皇后问题
- 在一个N×N的国际象棋棋盘中摆N个皇后,使这N个皇后不能互相被对方吃掉。-Put on N queens in a N multiply N chessboard,preventing each queen to be knocked over
N皇后问题的回溯法,非递归实现
- 这是N皇后问题的回溯法,非递归实现.此算法对初学者有难度,最好去参考书.这个问题也是回溯法的经典例题,推荐自己去实践.还有,我贴的程序在TC3.0下调试通过.-This the Queen's retroactive law, non - recursive. This algorithm is difficult for beginners, to the best reference books. This issue is also back classic example of
QUEues皇后问题
- 此程序完成N皇后问题。大家可以互相讨论学习。-N Queen's problem. We can learn from each other discussions.
tNQueens
- 链式结构堆栈类的类模板实现及用堆栈类求解N皇后问题-chain structure of the stack type and class template stack used for solving problems N Queen
n-queen
- 解决最多28个皇后问题,用backtracing+forwardChecking+reschedul-variable
Queen
- 利用回溯法和栈来实现八皇后问题:在n×n的国际象棋棋盘上,安放n个皇后,要求没有一个皇后能够“吃掉”任何其他一个皇后,即没有两个或两个以上的皇后占据棋盘上的同一行、同一列或同一对角线-Use of backtracking and stack to achieve the eight queens problem: the n × n chess board, place n queens, a queen is not required to " eat" any other
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
8-queen
- 通过遗传算法实现八皇后的求解问题,用MFC实现可视化操作,界面很漂亮,算法是改良的遗传算法-Through the genetic algorithm for solving the eight queens problem
queen
- 运用回溯法解决8皇后问题,进而可以使用本方向推广到N皇后问题。-The use of backtracking to solve 8 queens problem, in turn, can be extended to use the direction of N Queens problem.
Nqueens
- N皇后问题,N由自己输入的值来确定,然后输出所有皇后摆放的方法-N queens problem, N by their own input values to determine, and then display the output all the way to Queen' s
8queens-problem
- 八皇后问题并行算法及源代码(附N皇后) 八皇后问题并行算法及源代码(附N皇后)-Eight queens problem parallel algorithm and source code (with N Queen) Eight queens problem parallel algorithm and source code (with N Queen)
vc8quween
- 1. 编写求n后问题的通用函数; 2. 取n=8计算出n后问题的所有可行解,并以8元组的形式输出(可以对可行解的结构进行分析,); 3. 随机输出2个可行解的图形。其中棋盘要有8×8的格子,Queen图象自选; -1. To prepare for issues common after n function 2. Take n = 8 calculated after n all feasible solution, and 8-byte form of output (can
nhuanghouwenti
- n皇后问题的求解,有具体的演示结果,并含有结果的个数-n queen problem solving, there are specific demonstration results, and contains the results of the number of
NQueens
- 这是一个八皇后问题的扩展,使用java实现,扩展到了多皇后,只要你输入皇后的个数,能给出所有的解。-This is an expansion of 8 Queen
NQueen
- 本实例通过堆栈以及回朔法进行N皇后的遍历.-This instance through the stack as well as the retrospective method of traversal N Queen.