搜索资源列表
Eidffakght
- 利用BFS算法解八数码问题 在3*3的方格上放着1-8数码,有一空格为0变化规则为空格可以和上,下,右,左四个相邻的数字互换, 至到和目标状态相等, 每一种状态用一个结点表示 而每个结点每次变化最多有四种结点,将这些结点依次入队列中, 例如初始结点S0,入队列后出队,将S0变化最多产生的四种结点S01,S02,S03,S04依次入队列中, 当S01出队后,产生的四种结点S11,S12,S13,S14(实际上不会有四种结点)依次入队, 每次出队时与结束结点相比较,如果
用A算法实现八数码难题
- 用A*算法来对人工智能中的八数码难题进行实现-A * algorithm used for artificial intelligence to the eight digital challenge to achieve
juigon
- 九宫问题(八数码)求解过程动态演示 用VC++编程实现,可以直观地看到演示效果!-JiuGongTu (Digital 8) solution process dynamic demonstration with VC + + programming, visual effects demo to see!
my8num.RAR
- 八数码问题的深度优先算法,优秀的显示效果。-eight digital depth of the priority algorithm, showed excellent results.
八数码难题
- 八数码难题用vc++编写-eight digital problem with the preparation vc
八数码问题
- 一个解决八数码问题的源码,不知道怎么样,多多指教-a digital solution to the problem source, I do not know how kind, exhibitions
eg
- 一个简单的求解八数码问题的程序。采用A*算法,注释清晰易读-A simple eight digital problem solving procedures. Using A* algorithm, legible notes
eightnums
- 八数码拼图程序源码,可以实现初始8个数码顺序到目标8个数码顺序的自动拼图-Eight digital jigsaw program source code, can achieve the initial eight digital sequence to the target sequence of eight digital automatic puzzle
node
- 自己编写的解八数码问题的简单算法,用c++实现-I have written eight digital solution of a simple algorithm for the problem.
zhmjiugong
- 八数码问题全局择优算法这个程序是上学期上人工智能课的时候,老师让做的,采用全局择优算法.-8 digital issues overall are merit-based algorithm for this procedure on the artificial intelligence class last semester, the teacher to do so, and the use of the overall selection of the best algorithm.
8_DIGIT
- 八数码问题的详细解答,其中包含了宽度优先,深度优先,等算法-well solved the problem of 8
AIsearchproblem
- 对于通常的九宫问题(八数码)的一个解决方案,程序中实现的三种搜索算法——深度,广度,启发式-Nine-palace for the usual problems (8 digital) of a solution, and procedures to achieve the three search algorithms- depth, breadth, heuristic
8_num
- 深度优先搜索八数码问题[VC++] 简单实用-Eight digital depth-first search problem [VC++] simple and practical
8shuma
- 八数码的问题描述,以及解答的源代码。用广度优先搜索-Eight digital descr iption of the problem, as well as answers to the source code. Using breadth-first search
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
8ma
- 八数码难题,使用广度搜索,体现分支限界法的思想-Eight puzzle, use the search scope, reflecting the branch and bound ideas ×××××
8
- 八数码问题 单向启发式搜索 hash表 标准的八数码解-Eight-way digital issue standard heuristic search hash table of eight digital solution
八数码A*算法,A算法
- 八数码A*,A算法程序,使用c语言实现。只需将txt中内容复制,粘贴到C语言运行环境中,即可。
8数码问题
- 对任意的八数码问题,给出求解结果。例如对于如下具体八数码问题:通过设计启发函数,编程实现求解过程,如果问题有解,给出数码移动过程,否则,报告问题无解。
