搜索资源列表
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
N-Queens-Algorithm
- N皇后问题算法，N皇后问题是关于国际象棋的一个著名问题，本算法给出了其中一种解法-N Queens Algorithm
n-queen
- 解决N皇后问题，里面有不同方法的分析，还有上限，我记得是100个-Sovle the "n queen" problem
n-Queen
- 用c++实现n皇后的算法源码，注释比较详细，用回溯算法实现的-N queen algorithm source code with c++, a more detailed annotation, backtracking algorithm to achieve
n-queen
- 实现著名的n皇后问题，vs2008开发环境-Realization of the famous n queens problem, VS2008 development environment
N-Queens-problem
- N皇后问题回溯算法，算法质量高，参加ACM的同学，喜欢C算法的同学可以研究一下-N-Queens problem backtracking algorithm, the algorithm of high quality, to participate in the ACM students, students like C algorithm can be studied
N-queen-problem
- N皇后问题，解决N皇后问题，详细的C代码-N-Queens problem, solve the N queens problem, the details of the C code
N-queen
- 求解n皇后问题。给定一个N×N的棋盘，在棋盘上放置N个皇后，使得N个皇后两两之间互不攻击。任何两个处于同一列，同一行，同一对角线上的皇后都会互相攻击。 -Solve the n queens problem. To set a NN board, place N queens on a chessboard, making the N-queens do not attack each other between every two. Any two in the same column,
n-kings
- 写了一个非常常见的n皇后问题，输入输出均用文本文件显示。源码！-Wrote a very common n-queens problem, the input and output text file. Source!