搜索资源列表
八数码多算法实现
- 这个程序是从广度优先搜索，深度优先搜索，A算法以及A*算法等多方面算法来解决八数码问题-this procedure is breadth - first search, depth-first search, A and A * algorithm algorithm various algorithms to solve the problem eight digital
八数码问题（A星算法）
- 用A*算法求解八数码问题。A*算法又叫做最佳图搜索算法，是满足启发函数不大于实际耗散值的A算法，可以用理论证明如果最佳解图存在的话，一定可以用A*算法找出来。-with A * algorithm eight digital problem. A * algorithm also called the plan the best search algorithm, it is instructive function to meet not more than the actual value
人工智能八数码问题
- 人工智能八数码问题，包括盲目搜索，不在位和距离两种A*算法。
八数码
- 用A*算法解决八数码问题
人工智能经典问题八数码三种算法
- 人工智能经典问题八数码三种算法（广度优先搜索，深度优先搜索，启发式搜索）带有图形界面的解决方案。-Classic problem in Artificial Intelligence eight digital three algorithms (breadth-first search, depth-first search, heuristic search) with a graphical interface solutions.
EIGHTPUZZLE
- 用A*算法解决八数码问题，人工智能实验，内附实验报告。源码注释很详细-With the A* algorithm to solve 8 puzzle problem, artificial intelligence experiments, containing a laboratory report. Very detailed source notes
AStar
- 八数码问题的A*算法实现，java的伪代码，基本思想-8 digital issues of A* algorithm, java pseudo code, the basic idea
new8
- 人工只能中的八数码问题，采用A*算法搜索-Artificial only in the eight digital issues, the use of A* algorithm search
eg
- 一个简单的求解八数码问题的程序。采用A*算法，注释清晰易读-A simple eight digital problem solving procedures. Using A* algorithm, legible notes
node
- 自己编写的解八数码问题的简单算法，用c++实现-I have written eight digital solution of a simple algorithm for the problem.
Eight-puzzle
- 这个程序是A*算法的简单实现，来解决八数码问题-It just simply applys the A* algorithm to solve the Eghit-puzzle problem
eight-digit
- 求解八数码问题,初始状态存放在文件中，读入后使用A*算法求解8数码问题，目标状态为1238_4765，即从左上角开始为1，然后按顺时针排列在九宫格中。输出为具体求解步骤-Solving the eight digital issues, the initial state stored in the document, read to use the A* algorithm to solve 8 digital issues, the target state for the 1238_476
AIsearchproblem
- 对于通常的九宫问题（八数码）的一个解决方案，程序中实现的三种搜索算法——深度，广度，启发式-Nine-palace for the usual problems (8 digital) of a solution, and procedures to achieve the three search algorithms- depth, breadth, heuristic
eigthnum
- 宽度优先搜索算法八数码问题代码： 把起始节点放到OPEN表中(如果该起始节点为一目标节点，则求得一个解答）-Breadth-first search algorithm eight issues digital code: the start node on OPEN table (if the start node as a target node, then find an answer)
8
- 用A*启发式算法解决八数码问题,用纯C实现-using A* algorithm to solve Eight-puzzle
atree
- 八数码问题用A*算法实现 VC++6.0实现的八数码问题-eightnum
8_puzzle
- 8数码问题 八数码问题 A*算法 Hash结构-eight puzzle problem
8数码
- 实现八数码问题的一个小算法平台，其中包括深度优先、广度优先、最好优先算法。(A small algorithm platform for eight digital problems, including depth first, breadth priority and best priority algorithm.)
A星算法求解八数码问题(20180320125952)
- A星算法求解八数码问题, 人工智能作業2(A star algorithm to solve eight digital problems, artificial intelligence operation 2)
八数码问题 C语言代码
- 人工智能课基于A*算法的八数码问题 C语言实现