搜索资源列表
A-search-algorithm-
- A搜索算法 在八数码问题中应用,c 实现源码-A search algorithm is applied in eight digital issues, c source code to achieve
8Puzzle_Astar
- 人工智能经典问题八数码的A*算法实现。没有图形界面。-Eight digital artificial intelligence classic problem of A* algorithm.
8Puzzle_BFS
- 人工智能经典问题八数码的广度优先搜索算法实现。没有图形界面。-Classic problem of artificial intelligence, eight digital breadth-first search algorithm. No graphical interface.
EightPPuzzle
- 这是用C++写的八数码和八王后问题的代码,功能可能简单点,但是都实现了基本功能。所以是应付课程设计的不错选择。-This is written in C++ digital and eight queen problem code, functions may be simple, but can realize the basic functions of. So it is a good choice to cope with the curriculum design.
2004062923325819487
- 八数码问题,基于A*算,A*算法是一种有序搜索算法,其特点在于对估价函数的定义上。对于一般的有序搜索,总是选择f值最小的节点作为扩展节点。-Eight digital issue
analysis
- 数码摄影相对传统摄影在摄影教学中的优势分析-Digital photography relatively traditional photography in photography teaching superiority analysis
8-digit-BrandABound
- 广度优先搜索实现8数码问题,C语言实现,代码不长,不到三百行,仅供参考。-implemention of 8 digital problem by Breadth first search
8-digit-ClimbM
- 通过使用爬山法实现8数码问题,代码约三百行,仅供参考-Mountain climbing method to implement 8 digital problem
8_num
- 人工智能的八数码问题,采用的A*启发式搜索,显示运行时间和每一步运行过程。基于MFC的-Eight puzzle problem in artificial intelligence, using the A* heuristic search, display the running time and every step of the operation process. MFC-based
eightNum_lufeiop
- 以八数码问题为例,设计一类滑块问题的求解系统,初步掌握智能搜索算法中的盲目搜索和启发式搜索这两类基本方法,同时通过具体的问题体会搜索算法、数据结构、程序设计等知识的综合应用 A*用到是不在位将牌数和曼哈顿距离,动态显示,有算时间 我自己很用心做的,有实验报告,绝对详细-Eight digital issues, for example, design a slider problem solving system, initially grasp the two basic method
eightnum
- 八数码是人工智能的一个典型问题,这是一个用C++编写的八数码程序-Eight digital is a typical problem of artificial intelligence, which is a C++ and eight digital program
8shuma
- 使用VC6编译环境,针对人工智能中的八数码问题使用A*和广度优先和深度优先算法,分别求解,将解算过程输出到相应txt文件-using VC6 implement the eight number problem in AI.
Astar
- a*算法解决8数码问题。在游戏设计中,经常要涉及到最短路径的搜索,现在一个比较好的方法就是用A*算法进行设计。他的好处我们就不用管了,反正就是好!^_*-a star
jiugongge
- 运用图的搜索,找到把数码之间的转换步骤,只是不能找到全部的路径,能找到初始状态和目标状态之间的步骤-Use of the graph search, find the digital conversion between steps
8-shuma
- 基于a*算法的八数码问题源代码,八数码问题,广度优先,递归-Source code based on the a* algorithm, eight digital
jiugong
- 用java实现重排九宫问题(即八数码问题),人工智能-This is a project about java
0
- 6 数码管(静态显示) 6 数码管(静态显示)-6 digital control (static display) 6 digital control (static display) digital tube (static display)
A_Star
- 在3*3组成的九宫格棋盘上,摆有8个将牌,每一个将牌都刻有1-8中的某一个数码。棋盘中留有一个空格,允许其周围的某一个将牌向空格移动,这样通过移动将牌就可以不断改变将牌的布局。给定一种初始的将牌布局或结构(称初始状态)和一个目标布局(称目标状态),编程给出一个最优的走法序列。 -3* 3 composed of squared board, put 8 cards, each of the license are inscribed with a digital 1-8. The chess
eightnumber
- 八数码难题,又称九宫格问题,也是我们平时玩的华容道,用分支限界法解决该问题-Eight digital problem, also known as the squared problem, we usually play Huarong, branch and bound method to solve the problem
lessnumberfirst
- 八数码难题的第二种解法,仍然用分支限界法,但是选择的优先策略变成了不在目标位置上的数最少的优先的方法-The second solution of eight digital problems are still using the branch and bound, but to select the priority strategy into a not in the target location on the least number of priority