搜索资源列表
DigitalProblemPQ
- 基于C语言,采用A*算法实现八数码问题。-Based on the C language, using A* algorithm to achieve eight digital issues.
8Puzzle_Astar
- 人工智能经典问题八数码的A*算法实现。没有图形界面。-Eight digital artificial intelligence classic problem of A* algorithm.
2004062923325819487
- 八数码问题,基于A*算,A*算法是一种有序搜索算法,其特点在于对估价函数的定义上。对于一般的有序搜索,总是选择f值最小的节点作为扩展节点。-Eight digital issue
eightNum_lufeiop
- 以八数码问题为例,设计一类滑块问题的求解系统,初步掌握智能搜索算法中的盲目搜索和启发式搜索这两类基本方法,同时通过具体的问题体会搜索算法、数据结构、程序设计等知识的综合应用 A*用到是不在位将牌数和曼哈顿距离,动态显示,有算时间 我自己很用心做的,有实验报告,绝对详细-Eight digital issues, for example, design a slider problem solving system, initially grasp the two basic method
8shuma
- 使用VC6编译环境,针对人工智能中的八数码问题使用A*和广度优先和深度优先算法,分别求解,将解算过程输出到相应txt文件-using VC6 implement the eight number problem in AI.
8-shuma
- 基于a*算法的八数码问题源代码,八数码问题,广度优先,递归-Source code based on the a* algorithm, eight digital
Java-Eight
- Java版八数码游戏 更优化的算法,更直观的界面 可以随机生成八数码图由用户来拼 解不出来? 没关系,电脑帮你拼回去-Java version of the eight digital game More optimization algorithms, a more intuitive interface Randomly generated eight digital format by the user to fight Solution does not come
eightdigital
- 个八数码拼图是根据网上的一个简单的拼图游戏改编而来。本程序保留了原程序的主要界面,重写了拼图主要功能的实现方法,加入了八数码的A*算法,使其可以完成自动拼图功能。-Eight digital puzzle is adapted from a simple jigsaw puzzle online. This procedure retains the original program' s main interface, and rewrite the main function of t
8puzzle
- 用MFC把八数码问题的算法实现,深度优先,广度优先,A算法都实现了,大家可以参考一下,应该用得上-Eight digital algorithm to achieve with MFC, depth-first, breadth-first, A algorithm are realized, we can refer to, you should need them
bashuma
- 人工智能 八数码问题实现算法,使用了A*算法,实验报告附带源码-Artificial Intelligence eight digital algorithm, using the A* algorithm, experimental report incidental source
eight_number
- A*算法求解八数码问题 可以输出最优解 以及所有拓展节点-A* Algorithm eight digital output of the optimal solution, as well as all expand node
eight
- 使用A*算法解决八数码问题。这是我的一份作业,-A* algorithm solve eight digital issue. This is my job,
Improved_EightPuzzle1
- 八数码问题算法的改进实现,内附详细的设计文档。-Improved implementation of the eight digital algorithm, enclosing a detailed design document.
eight
- 八数码问题也称为九宫问题。在3×3的棋盘,摆有八个棋子,每个棋子上标有1至8的某一数字,不同棋子上标的数字不相同。棋盘上还有一个空格,与空格相邻的棋子可以移到空格中。要求解决的问题是:给出一个初始状态和一个目标状态,找出一种从初始转变成目标状态的移动棋子步数最少的移动步骤。所谓问题的一个状态就是棋子在棋盘上的一种摆法。棋子移动后,状态就会发生改变。解八数码问题实际上就是找出从初始状态到达目标状态所经过的一系列中间过渡状态。 八数码问题一般使用搜索法来解。搜索法有广度优先搜索法、深度优先搜索法
eight_num
- 八数码问的A*算法解决 可以求出所有的搜索过程 并且输出最优解-The eight digital asked the A* algorithm to solve the obtained search process and output the optimal solution
problem-of-eight-number
- 本文档讲解经典难题八数码问题,通过给出广搜、A*算法的实例。容易理解,适合学习算法的初学者。-This document explaining the the the classic conundrum eight digital problem by giving wide search, A* algorithm instance. Easy to understand for beginners learning algorithm.
bashuma
- 九宫格也即八数码问题程序 仅供参考 又vc++编写 a*改进算法-Jiugongge also eight digital program for reference only and vc++ write a* Improved algorithm
Puzzle-Killer-1.2
- 经典的八数码和十五数码问题的完美解决方案,对于任何情况均可以迅速出解,并且可以动态演示。并非用传统的A*或IDA*算法实现,效率远高于A*和IDA*算法。-The classic eight digital and 15 digital perfect solution for any situation can be quickly out of solution, and can be a dynamic presentation. Not achieve with traditional
8code
- 通过A*算法实现八数码(评估函数是通过不在位的将牌数来计算的)-A* algorithm to achieve the eight digital
Artificial-Intelligence-EIGHT-NUMBER
- 人工智能实验 运用启发式搜索中的A*算法和A算法分别比较求解八数码问题-Artificial intelligence experiments using heuristic search in A* and A algorithms for Eight digital