搜索资源列表
c++buildermaze
- 用C++BUILDER做的一个迷宫,可以实现深度优先,广度优先和启发式搜索算法-C BUILDER do a maze, can achieve priority depth, breadth priority and heuristic search algorithm
spath
- 有关启发式搜索的经典算法:A*最短路径算法的实例和对应程序。关注的朋友可以留意一下。(比传统的Dijistra算法效率高很多哦!^_^)-the heuristic search algorithm of the classic : A * shortest path algorithm examples and the corresponding procedures. Concerned friends can look. (Dijistra than the traditional alg
WinNTL-5_3_1
- 密码学界牛人Victor Shoup用C++编写数论类库。 NTL is a high-performance, portable C++ library providing data structures and algorithms for arbitrary length integers for vectors, matrices, and polynomials over the integers and over finite fields and for arbitrary p
AIsearchproblem
- 对于通常的九宫问题(八数码)的一个解决方案,程序中实现的三种搜索算法——深度,广度,启发式-Nine-palace for the usual problems (8 digital) of a solution, and procedures to achieve the three search algorithms- depth, breadth, heuristic
SimulatedAnnealing
- Simulated Annealing (SA) is a smart (meta)-heuristic for Optimization. Given a cost function in a large search space, SA replaces the current solution by a random "nearby" solution. The nearby solution is chosen with a probability that depends on the
LCsearch
- 算法:华容道问题的启发式搜索。寻求一种最优解的快速算法。-Algorithm: Huarong issues heuristic search.
coloring_graph
- Algorithm colouring graph minimum numbers of colours. Dsatur heuristic algorithm.
matlabyiqunsuanfa
- 蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法,该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型,基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of opt
qingyun
- 清运启发式算法,简洁的结构,并且内含例子。-Clearance heuristic
8-pluzze
- 这个是基于启发式搜索算法解八数码问题的一个演示程序,旨在演示启发式搜索及A*算法的基本使用方式。内部已经写好了三种启发式算法,可以在使用过程中选用。并另附了一份实验报告。-This is based on the heuristic search algorithm for solving the the 8-puzzle Problem. Program showed how to use heuristic search and A* algorithm. Within three heu
graph-search-algorithm
- 图搜索的非启发式和启发式算法, 着重分析了它们各自的复杂性、优缺点及 其相互关系, 提出了改进要点. 这对于如何选用一个合适的搜索算法是十分有益的.-Figure of non-heuristic and heuristic search algorithm, analyzes the complexity of their respective advantages and disadvantages and their relationship, an improved points.
fenzhijiexianfa
- 分支界限法是由“分支”和“界限”策略两个部分组成,其中“分支”策略是对问题空间按照广度优先的策略进行搜索;“限界”策略是为了加速搜索速度而采用启发信息剪枝的策略。 使用分支限界法来解决单源最短路径问题时主要利用结点控制关系剪枝,在一般情况下,如果解空间树中以结点Y为根的子树中所含的解优于以结点X为根的子树中所含的解,则结点Y控制了结点X,以被控制的结点X为根的子树可以剪去。算法实现时,使用邻接矩阵表示图,二维数组存储图的邻接矩阵,使用数组记录源到各顶点的距离和路径上的前驱顶点。 -Br
AHSACPinGo
- Paper <A Heuristic Search Algorithm for Capturing Problems in Go>
main
- 采用启发式修补方法实现的N皇后问题,最后意图的方式输出结果。-Heuristic repair method to achieve the N queens problem, the way the final output intentions.
8
- 八数码问题 单向启发式搜索 hash表 标准的八数码解-Eight-way digital issue standard heuristic search hash table of eight digital solution
a
- A*寻路算法 迷宫算法 启发函数-A* pathfinding algorithm heuristic algorithm maze
Hua-rong-dao
- 华容道的广度优先搜索求解——散列查找和启发式搜索的应用-The game hua-rong-dao breadth first search solution-hash search and heuristic search application
nQueens
- 关于N皇后C++程序,这个程序运用了启发式搜索-heuristic search about n queens using C++
eightNum_lufeiop
- 以八数码问题为例,设计一类滑块问题的求解系统,初步掌握智能搜索算法中的盲目搜索和启发式搜索这两类基本方法,同时通过具体的问题体会搜索算法、数据结构、程序设计等知识的综合应用 A*用到是不在位将牌数和曼哈顿距离,动态显示,有算时间 我自己很用心做的,有实验报告,绝对详细-Eight digital issues, for example, design a slider problem solving system, initially grasp the two basic method
ANT
- A*算法通过启发式探索下一结点,逐步逼近目标结点,且使得路径最短。-A* algorithm heuristic to explore the next node, and gradually approaching the target node, and that the shortest path.