搜索资源列表
veelionAI
- 人工智能中经典算法-宽度搜索和启发是搜索（A*算法）在VC环境下的实现代码，对于学习人工智能有很多帮助- In the artificial intelligence the classical algorithm - width search and the inspiration are the search (the A* algorithm) under the VC environment realization code, has regarding the study arti
求解野人与传教士问题
- 求解野人与传教士问题，利用C语言实现宽度搜索算法。
EIGHTNUM
- 八数码 大家看看就知道了 宽度搜索 怎么非得够20个子呢？
HRD
- 最大宽度搜索法来解决华容道问题，包括10个经典局面，可以单步运行，连续运行，以及设定一定时间间隔来运行
宽度优先
- 宽度优先搜索法见cpp1.cpp文件，在vc6.0环境运行实现-width priority search see cpp1.cpp documents in the operation to achieve environmental vc6.0
8digitalWidthsearch
- 经典的人工智能实验8数码宽度搜索--自河工05级计算机赵丽娜-Classic experiment in artificial intelligence 8 digital width search- 05 computer from the Hebei University of Technology Li-Na Zhao
guangdusousuo
- 宽度优先搜索算法（又称广度优先搜索）是最简便的图的搜索算法之一，这一算法也是很多重要的图的算法的原型。Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想-Breadth-first search algorithm (also known as breadth-first search) is the most simple plan, one of the search algorithm, this algorithm is also a lot of
Exa
- 利用C语言实现宽度搜索算法，实现自动对一个智力测验题求解-The use of C language realization of the width of the search algorithm, for automatic testing of a mental problem solving
searching
- 这是2个关于搜索算法的实现，为深度优先搜索和宽度优先搜索。希望大家喜欢！-This is a 2 on the implementation of search algorithms for the depth-first search and breadth-first search. Hope everyone likes!
8PuzzleProblem
- 实现了简单的宽度优先搜索，算法比较简单，课程设计时可用。-To achieve a simple breadth-first search
migong
- 迷宫游戏，采用宽度搜索算法找到走出迷宫的最短路径-Maze game, with the width of the maze search algorithm to find the shortest path
fsad
- 传教士野人问题，宽度搜索算法。可以实现四组输出四条不同路径-fasd for AI
AI_BallGame_ByQt
- 用 Qt Creator 写的一个小球游戏，通过旋转地图使小球下落，最终落到目标洞中。 其中加入了宽度搜索算法自动寻路和地图编辑功能。-Qt Creator written with a ball game, ball by rotating the map to fall, eventually fell to the target hole. Joined the width of the search algorithm which automatically find its way
hangdianACM
- 杭电ACM题目若干，关于图，深度优先搜索，宽度搜索等等。-Hangzhou Xinhua ACM topic number on map, depth-first search, breadth search and more.
ROADS
- 这是一道关于最短路径的算法问题，虽然问题简单但是其中的思想非常值得借鉴和学习，其中用到了优先队列和图的宽度搜索-This is a question about the shortest path algorithm, although the problem is simple, but the idea which is worth learning and learning, which uses the width of the search priority queue and ma
search1
- 人工智能pac-man经典搜索，包括宽度、深度、一致代价搜索和A*搜索(Artificial intelligence Pac-Man classic search)
cube
- 还原二阶魔方，输入魔方六个面二十四个色块的面的颜色可以得到还原步骤(Restore the two order Rubik's Cube)
WFS
- 广度（宽度）优先搜索，将八数码问题简化成三数码问题求解(Breadth (range) first search simplifies the eight digital problem into three digital problem solving)
triented
- 利用C语言实现宽度搜索算法,实现自动对一个智力测验题求解()
anhuy09
- 利用C语言实现宽度搜索算法,实现自动对一个智力测验题求解()