搜索资源列表
5-Queen
- N皇后问题!图形界面演示,VC6.0开发-N Queen! GUI demonstration VC6.0 development. .
n-Queen
- 算法设计:著名的n后问题:在nXn的棋盘上放彼此不受攻击的n个皇后,按国际象棋的规则,任何2个皇后不在同一行或同一列或同一斜线上. 本算法才用回朔法来解决.-algorithm design : n after the famous question : In nXn put on the chessboard of each other against attack n empress, according to the international rules of chess, any
N-queen-Cplusplus
- 解国际象棋的N皇后问题的C++源代码,可用于大学计算机技术课程《算法分析》上机联系-Solutions International Chess Queen of the N C source code, University computer can be used for technical courses "algorithm analysis" on the plane link
n皇后问题
- n皇后问题的C++实现-n Queen's realization of C
运用递归来解N皇后问题
- 运用递归来解N皇后问题-use recursive solution to the problem of N Queen
queenn(N皇后问题)
- 在一个N×N的国际象棋棋盘中摆N个皇后,使这N个皇后不能互相被对方吃掉。-in an N N chess board wavers N Queen so that the N-Queens that can be eaten by the other side.
回溯法N皇后问题
- 这是计算机算法中的回溯法中的一个经典的问题--N皇后问题!希望对学计算机算法的同学有用!-This is a computer algorithm, the retroactive law on the issue of a classic -- N Queen! Want to learn how to use computer algorithms useful to the students!
N皇后摆法动态演示
- 用VC编写的N皇后摆法动态演示程序,已经较为完美!欢迎下载指导!-A N queen game dynamic demonstration program write in VC, already perfect. please come and download!
queen
- 拉斯维加斯(Las Vegas)算法来解皇后控制问题的解题报告和源代码。问题描述:在一个n×n个方格组成的棋盘上的任一方格中放置一个皇后,该皇后可以控制他所在的行,列以及对角线上的所有方格。对于给定的自然数n,在n×n个方格组成的棋盘上最少要放置多少个皇后才能控制棋盘上的所有方格,且放置的皇后互不攻击? 设计一个拉斯维加斯算法, 对于给定的自然数n (1≤n≤100)计算在n×n个方格组成的棋盘上最少要放置多少个皇后才能控制棋盘上的所有方格,且放置的皇后互不攻击。 -Las Vegas
shangchuan
- n皇后算法,多边形裁减,正方体旋转,三角形的绘制与填充,画虚的直线和曲线-n Queen s algorithm, polygon reduction, cube spins, drawing a triangle with the filling, painting imaginary straight lines and curves
Queen
- 用概率算法结合回溯思想实现n皇后问题,并计算算法执行的时间。-Algorithm combined with the probability of backward thinking of the realization of n queen problem and algorithm execution time.
Nqueen
- N皇后问题的回溯算法,非常简单,容易看懂-N Queen s problem back algorithm, is very simple, easy to understand
Queen_lv
- 采用LasVegas概率算法高效解决N皇后问题,并统计其成功与失败的概率,这是中国科技大学的高级算法设计的设计-LasVegas probability algorithm used to solve N Queen efficient, and its success or failure of statistical probability, which is China University of Science and Technology Advanced Algorithm Desi
queue
- n皇后问题的C++求解方法,就是n个皇后不能同行也不能同列。-n queen problem C++ solving method, that is, n can not be a Queen s peers can not be with out.
javaalgorithm
- 包括冒泡排序,归并排序,N皇后,最小生成树等经典算法的java实现代码-Including bubble sort, merge sort, N Queen, such as the classic minimum spanning tree algorithm java code
queen
- 采用递归回溯算法求解N皇后问题;C语言实现,可以动态控制皇后数量-Backward recursive algorithm using N Queen' s problem C language implementation, you can dynamically control the number of Queen' s
ddvip_com_04065038a97af4
- 采用循环,而不是递规,系统资源占有少可计算 n 皇后问题把问题线性化处理,可以把问题分块,在分布式环境下用多台计算机一起算。-The use of the cycle, rather than delivery rules occupy less system resources computable n Queen of issues to deal with the problem of linear, you can block the problem, in distributed en
queen
- n皇后问题,能够快速的算出24个点,24个点过侯程序会变慢-the question of queen
sschubu
- 搜索初步介绍,包括深度搜索和广大搜索,有n皇后代码及其他题目代码。-The initial search, including the majority of the depth of search and search, there are n Queen' s source code and other topics.
NQueenProblem
- n皇后问题,关于如何计算n皇后问题,里面的代码容易看懂,核心的是在针对试探-回溯算法所用的数据结构的设计上。 程序采用了递归,也就是借用了编译系统提供的自动回溯功能。-N Queen Problem