搜索资源列表
ddvip_com_051534f418cb8f
- 八数码难题，本程序分为Dos版和Windows版,但主要算法完全一样.本程序采用全局择优的启发式搜索算法来解决八数码难题.
EightNum
- 本程序采用全局择优的启发式搜索算法来解决人工智能中的八数码难题。
EightCode
- 用类A*算法的全局择优搜索法解决8数码问题,可以选择不同的启发函数
NNum
- N数码问题 本程序采用全局择优的启发式搜索算法来解决八数码难题
启发式搜索算法来解决八数码
- 本程序采用全局择优的启发式搜索算法来解决八数码问题
ddvip_com_051534f418cb8f
- 八数码难题，本程序分为Dos版和Windows版,但主要算法完全一样.本程序采用全局择优的启发式搜索算法来解决八数码难题.-Eight digital problem, the procedures are divided into Dos version and Windows version, but the main algorithm for the same. This procedure overall merit the
EightNum
- 本程序采用全局择优的启发式搜索算法来解决人工智能中的八数码难题。-This procedure using the overall merit of the heuristic search algorithm to solve the artificial intelligence of the eight digital dilemma.
EightCode
- 用类A*算法的全局择优搜索法解决8数码问题,可以选择不同的启发函数-Class A* algorithm search method to solve the overall selection of the best 8 digital issues, you can choose a different heuristic function
NNum
- N数码问题 本程序采用全局择优的启发式搜索算法来解决八数码难题-N digital issue of the overall merit of this procedure using the heuristic search algorithm to solve the problems of eight digital
8shunma
- 八数码问题求解，用C语言做的，以重排九宫问题为例演示全局择优搜索法的搜索过程-8 digital problem-solving, using C language to do, in order to demonstrate rearrangement of Lo Shu Square as an example the global search process preferred search method
bashumadaima
- 以重排九宫问题为例演示全局择优搜索法的搜索过程，要求有一定的普适性。-Rearrangement of Lo Shu Square as an example to demonstrate the overall selection of the best search method searching process, requiring a certain degree of universality.
Global-merit-based-search
- 全局择优搜索（人工智能课程所需内容）适合于实验课程-Global merit-based search
Genetic Algorithm
- 简单函数优化的遗传算法程序，遗传算法从问题解的串集开始搜索，而不是从单个解开始。这是遗传算法与传统优化算法的极大区别。传统优化算法是从单个初始值迭代求最优解的；容易误入局部最优解。遗传算法从串集开始搜索，覆盖面大，利于全局择优。(A genetic algorithm program optimized by simple functions)
GlobalFS
- 全局择优搜索，初始状态：BBBWWWE，目标状态：W全在B的左边(Global preferred search, initial state: BBBWWWE, target state: W, all on the left of B)