搜索资源列表
EightQueen
- 八皇后问题 ：面向对象面向对象程序设计 叶乃文编 书上例题-Eight Queens Object-oriented object-oriented programming Milk yeh sample books
ypea116-tabu-search
- 结构化的禁忌搜索(TS)的MATLAB实现TSP和n-Queens问题-A structured implementation of Tabu Search (TS) in MATLAB for TSP and n-Queens Problem
solution
- 该问题是经典的八皇后问题，通过递归和回溯解决的经典算法问题-This is a classic problem of the eight queens problem, and by recursively backtracking algorithms classic problem
queen
- 求解N皇后问题，解决棋盘上皇后不能在同一横向竖向斜向的问题-Solving the N- Queens problem, not solve the queen on the board in the same vertical transverse oblique problem
DS-CourseDesign
- 山东大学数据结构课程设计 1.农夫过河 2.八皇后问题 3.公交线路现实优化问题 4.电话号码查找系统（含性能测试） -可直接编译运行- -Data Structure Course Design 1. Shandong University farmer across the river 2. Eight Queens bus lines real problem 3. Optimization 4. Phon
dil
- Using a recursive algorithm to achieve the eight queens problem, the realization of the basic ideas for reference in the queen,
ideav
- 运用递归算法实现了八皇后问题,基本思路借鉴于四皇后的实现,-Using a recursive algorithm to achieve the eight queens problem, the realization of the basic ideas for reference in the queen,
madziuk1995
- Solving the N-Queens problem with a binary Hopfield-type network
八皇后
- 算法分析课程设计，八皇后问题，源代码！！！(Algorithm analysis curriculum design, eight queens problem, the source code)
Eight_Queens
- 使用MIPS指令实现八皇后问题的求解，代码较精简(Solve the Eight Queens Problem with MIPS)
idbqsreadizationthe
- 运用递归算法实现了八皇后问题,基本思路借鉴于四皇后的实现,(Using a recursive algorithm to achieve the eight queens problem, the realization of the basic ideas for reference in the queen,)
8皇后
- 输出皇后问题的所有解，不仅支持8皇后问题(All solutions of the queen problem are not only supported by the 8 queens problem)
n皇后问题
- 递归回溯法求解并输出输出n皇后问题所有解法（n的取值不限）(Output all solutions to the N queens problem)
BFS 求解 N 皇后问题(252370)
- BFS算法实现N皇后问题，12个皇后是速度还行，超过了就有点慢。(BFS algorithm to achieve N queen problem, 12 queens is the speed is OK, more than a little slow.)
queen
- 这是在C语言环境下实现八皇后问题产生的程序(This is in the C language environment to achieve eight queens problem generated procedures)
爬山 完美
- 使用爬山法实现n皇后问题 输入 n，并用运行时间比较几种算法在相同规模的问题时的求解效率。列表给出结果。 比较同一算法在 n 不相同时的运行时间，分析算法的时间复杂性。(Use of climbing method to achieve the N Queens)
Desktop
- 用DFS解八皇后,这个是递归算法跟非递归算法(Using DFS to solve eight queens, this is a recursive algorithm with non recursive algorithm)
Queen
- 八皇后问题是一个经典问题，此代码可以解决，方便大家交流学习(Solving the eight queens problem)
N皇后
- 八皇后问题，是一个古老而著名的问题，是回溯算法的典型案例。该问题是国际西洋棋棋手马克斯·贝瑟尔于1848年提出：在8×8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。(The eight queen problem, an old and famous problem, is a typical case of backtracking algorithms. It i
回溯
- 一些回溯算法的总结里面有马跳日棋盘问题八皇后问题取苹果等一系列已过的代码谢谢参考(Some backtracking algorithms are summed up with a horse jump day chessboard problem eight queens and a series of past codes for reference.)