搜索资源列表
AIbashuma
- 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个\"扩展数组[4]\"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient
AIbashumaJava1
- 我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个\"扩展数组[4]\"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient
BFS_DFS_Astar
- Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The firs
two_directon_BFS
- 双向BFS搜索算法，是针对acm.hdu.edu.cn上1401题所实现的代码，效率非常高。
8 Puzzle by using BFS
- 8 Puzzle by using BFS , DFS
Chess(8puzzle)
- 这个程序是从广度优先搜索,深度优先搜索,A算法以及A算法等多方面算法来解决八数码问题.zip-8-puzzle A* BFS DFS MFC
EightPazzelBfs
- This project solve 8 puzzle with breadth first search. I wrote this program for Artificial Intelligence lesson.
eight8
- 用计算机搜索算法解8数码问题（也就是平时玩的拼图），内置2种算法，BFS和A*，是XJTU人工智能导论课的大作业。-Computer search algorithm for solving the problem of digital 8 (that is usually playing the puzzle), built-in two kinds of algorithms, BFS and A*, is the introduction course of artificial inte
BFS
- breadth-first search
Fast_8_puz18227611292004
- 8 puzzle problem it is. win the game by completing the tiles
BFS-v1.1
- 这是我写的人工智能的九宫问题，用广度优先搜索实现，效率不高。-This is my problem writing artificial intelligence Nine-palace, with breadth-first search to achieve efficiency is not high.
Alg_Ds
- BFS algorithm in C-BFS algorithm in C++
multiagent
- 实现了一个吃豆人小游戏的功能，使用了多种搜索算法，包括DFS以及BFS等-Implements a Pac-Man game features, using a variety of search algorithms, including DFS and BFS, etc.
BFS-for-eight-digit
- 广度优先搜索实现八数码，源码和可执行文件， 未优化，带注释-Breadth-first search to achieve eight digital, source code and executable files, Unoptimized, annotated
search-chen
- 使用Python编写的AI程序Pacman，可以适合AI的初学者，有BFS, DFS, UCS, A Star 运行的命令在commands.txt文件里 可以用 bash commands.txt演示-AI programs written in Python Pacman, AI can fit beginners, there BFS, DFS, UCS, the command runs in commands.txt A Star file can bash commands.t
BFS
- java环境下采用广度优先搜索来求解8-puzzle、8-queen等智能问题 -By using BFS java environment to solve the 8-puzzle, 8-queen, intelligent problem
N-queens-algorithm
- n皇后问题的BFS算法，算法简洁，作为初学者一看就懂，不过先看会BFS算法很重要，这比普通的动态规划速度要快很多-N queens problem BFS algorithm, the algorithm is simple, as a beginner to understand, but first look at the BFS algorithm is very important, which is much faster than the general dynamic planni
BFS 求解 N 皇后问题(252370)
- BFS算法实现N皇后问题，12个皇后是速度还行，超过了就有点慢。(BFS algorithm to achieve N queen problem, 12 queens is the speed is OK, more than a little slow.)
073545
- ppt about search(bfs && dfs) used in ACM_ICPC div hr div B 文件列表 B ： d()
maze solving algorithm
- Examples of applying the wall-follower, BFS, A* maze solving algorithms to solve a known maze environment.