搜索资源列表
NQueen
- N皇后问题,如何能够在 n×n 的国际象棋棋盘上放置n个皇后,使得任何一个皇后都无法直接吃掉其他的皇后-N queens problem, how can we place n queens on an n × n chessboard so that no queen can not directly eat other Queen
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
eight-queens
- 八皇后问题,包括BFS,DFS和回溯法运算。也可以解决n皇后问题。- Eight queens problem, including BFS, DFS and backtracking operations. N queens problem can be solved.
the-question-of-N-empress
- 在N*N的方格棋盘放置了N个皇后,使得它们不相互攻击(即任意2个皇后不允许处在同一排,同一列,也不允许处在与棋盘边框成45角的斜线上。 你的任务是,对于给定的N,求出有多少种合法的放置方法。 -Placed in the N* N the checkerboard N queen, so they don t attack each other (i.e. any two queen is not allowed in the same row, same column, are not
1
- N-皇后问题,利用回溯算法遍历求出能放置的位置方法。-N- queen problem, the use of backtracking algorithm traverse method can take the place of location.
NQueen_recursion
- 递归方法解决N皇后问题,任意两个皇后都不能处于同一行、同一列或同一斜线上。输出解法-A recursive method for solving N queens problem, any two queens are not in the same line, the same row or on the same diagonal. Output solution
NQueen_Nonrecursive
- 非递归方法解决N皇后问题,任意两个皇后都不能处于同一行、同一列或同一斜线上。输出解法-A non recursive method for solving N queens problem, any two queens are not in the same line, the same row or on the same diagonal. Output solution
include
- 1)编程实现n皇后算法,要求求出8皇后问题的所有解。 2)编程实现0-1背包问题的最优解。测试数据采用贪心算法一章的实验数据。 3)用图形输出中间过程。 4)在程序中添加统计扩展节点数,估计算法的复杂性。 -1) programming to achieve the queen n algorithm, the problem of all solutions to the 8 queens. 2) programming to realize the optimal sol
8QUEEN
- 使用回溯法求8皇后或者N皇后,可以进行输入查看皇后位置是否放错,也可以求回溯法的N皇后球法与普通蛮力法的效率比,-8 N Queen Queen or seek to use backtracking, you can enter to see if the Queen' s position wrong, you can find the N Queens backtracking ball method and efficiency than ordinary brute force
Queen
- 采用拉斯维加斯算法和回溯法相结合,解决N皇后问题-Las Vegas using algorithms and backtracking Combination, N Queens problem solving
nhuanghouwenti
- N皇后问题 题目描述: 在N*N的方格棋盘放置了N个皇后,使得它们不相互攻击(即任意2个皇后不允许处在同一排,同一列,也不允许处在与棋盘边框成45角的斜线上。 你的任务是,对于给定的N,求出有多少种合法的放置方法。 输入: 共有若干测试用例,每个测试用例对应一行一个正整数N≤10,表示棋盘和皇后的数量;如果N=0,表示输入结束。 输出: 对每个测试用例输出一行一个正整数,表示对应棋盘的皇后的可行放置方案总数。-N queens problem Subject de
Nhuanghou
- N皇后问题,输入N就可以展示出每一种情况以及情况总数-N queens problem, enter N can demonstrate in each case as well as the total number of cases
3
- 需要用回溯算法的题目:n皇后问题、素数方格问题、构造字符串、迷宫问题(包含题目及详细解答)。 回溯法的优化:递归前对尚待搜索的信息进行预处理、记忆化搜索。-Backtracking algorithms needed topics: n queens problem, prime squares problem, construct a string, the maze problem (including the title and a detailed answer). Optimi
1196
- N皇后问题的回溯算法 -N Queen' s problem backward algorithm N Queen' s problem backward algorithm
NQueen
- 本程序由八皇后问题出发,为解决N皇后问题。本程序是跨平台设计,由宏UNIX选择是UNIX还是WIN 。-The procedure starting the eight queens problem, to solve N-Queens problem. The program is cross-platform design, the choice is UNIX or UNIX macro WIN.
src
- N 皇后递归代码 冒泡、堆排、快排、归并
recall
- 熟悉和掌握回溯搜索的定义和算法过程,并利用回溯算法求解N皇后问题,理解求解流程和搜索顺序。-Familiar with and master the definition and algorithm of back in the search process, and make use of backtracking algorithm to solve the N queens problem, understand the solving process and the search ord
nqueen-bt
- 在vc++环境下,使用回溯法解决任意n皇后问题-In vc++ environment, use backtracking to solve any n queens problem
suanfasheji
- 常见算法设计与分析源代码,包括背包问题,n皇后问题,大整数乘法,阶乘问题,汉诺塔等-Common algorithm design and analysis of source code, including the knapsack problem, n queens problem, large integer multiplication, factorial problem, Tower of Hanoi, etc.