搜索资源列表
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
N-QUEEN
- 在一个N×N的国际象棋棋盘中摆N个皇后,使这N个皇后不能互相被对方吃掉。 N皇后算法源码-N × N in a chess board in N months before Queen s, so that the N-Queen s was the other side can not eat each other. N Queen s algorithm source code
Queen_GA
- 使用人工智能的遗传算法来解N皇后问题,能已较快的速度来搜索N皇后。-The use of artificial intelligence genetic algorithms to solve N Queen s problem, can have high speed to search for N Queen.
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
n
- 这是n皇后回溯法,可能有点不是很优的,大家拿去多改进-nqueque
n-queen
- n皇后问题,迷宫问题,递归实现皇后寻找迷宫出路,经典算法之一-n queen problem, the maze problem, the recursive realization of the maze to find a way out of Queen' s, one of the classic algorithm
queen
- n皇后问题,能够快速的算出24个点,24个点过侯程序会变慢-the question of queen
NQueen
- n皇后问题可以表示成n-元组(x1,…,xn),其中xi是放在第i行的皇后所在的列号。于是,解空间由nn个n-元组组成。 显示约束条件为Si={1,2,…….,n},1 i n。 隐式约束条件之一为没有两个xi相同(即任意两个皇后不在同一列上)。将其加入到显式条件中,于是解空间的大小由nn个元组减少到n!个元组。 -n queens problem can be expressed as n-tuple (x1, ..., xn), where xi i
n-queens
- 使用vc++实现数据结构中的n皇后问题的实现,使用递归算法完成此项操作基本比较简单-Using vc++ data structure, the realization of n-queens problem, using the basic recursive algorithm is relatively simple to complete this operation
nqueens-recursion-backtracking-n^n
- n皇后问题的递归回溯实现, 状态数:n^n-n queens problem of recursive backtracking implementation, the number of states: n ^ n
N-Queens
- 软件架构的N皇后问题,这个算法效率比较高-Software architecture of the N queens problem, this algorithm is more efficient
n-q
- 八皇后,n皇后问题C语言实现,求解所有可行解 -Eight Queens, n queens problem C language, all the feasible solutions for solving
n-Queen-PRoblem
- 使用Hopfield人工神经网络解决"N-皇后"问题-A copy of source code about how to resolve N-Queen problem with Hopfield artificial neural network.
N-queen-problem
- n皇后问题 n皇后问题 n皇后问题-n queens n queens n queens n queens n queens problem
N-Queen
- N皇后问题的演示程序,清晰的图形界面显示-N Queens problem demo, clear graphical display
N-queen
- 用c++语言提供了N皇后问题的算法描述,大家可以参考。-C++ language with the N-queens algorithm descr iption, we can reference.
n-queens-graphical
- n-queens graphical,是算法分析与设计里N皇后的c+=代码,程序将问题进行了图形化-n-queens graphical
N-Queen-problem
- 可以实现N皇后的问题 运用简易算法 大大降低了耗时-N-Queens problem can be achieved using simple algorithm greatly reduces the time-consuming
N-Queens
- pascal语言使用迭代法求解N皇后问题的源码-pascal language use iteration method to solve N-Queens problem code
N-Queens10000Artificial
- 主要利用人工智能的方法实现10000个N皇后问题-The main use of artificial intelligence methods to achieve 10 000 N Queens