搜索资源列表
bashuma
- 八数码问题，用广度优先和深度优先算法实现。并且用mfc实现界面，让结果算法运行过程以动画显示。并附上实验报告-Depth-first search algorithm and the breadth-first search algorithm
8num
- 八数码问题的简单算法，广度优先 字数补丁.exe-8 digital issues simple algorithm, breadth-first words patch. Exe
eightnum
- 三种算法(A*,广度优先,深度优先)求解八数码问题，方便对三种算法的优劣作比较-Three algorithms (A*, BFS, DFS) for Eight digital issues, to facilitate the merits of the three algorithms for comparison
8numcant
- 广度搜索八数码问题，用康托展开判重，哈希表的思想。-BFS 8 digital issues, with Cantor re-start negotiations, hash table ideas.
source_code
- 八数码（启发式和广度优先搜索两种方法实现）+骑士巡游+比赛日程安排等经典问题的C++源代码-the source code of some classic problems, such as 8 puzzle question, Knight Parade, and Competition Schedule.
eight-number
- 八数码的三种解法：A算法，广度优先，深度优先-Three Solutions to eight digital: A algorithm, breadth-first, depth first
eight
- 八数码拼图游戏的求解程序,通过双向广度优先搜索算法,输出最优解的路径.-Eight digital jigsaw puzzle solving process, through bi-directional breadth-first search algorithm, the optimal solution output path.
EightPuzzle
- 基于MFC的八数码寻径问题，包括经典的人工智能算法：深度优先算法，广度优先算法及A*算法 动态显示搜索结果。-Eight digital MFC-based routing issues, including the classic artificial intelligence algorithms: depth-first algorithm, breadth-first algorithm and A* algorithm dynamic display of search result
EightPuzzl
- 解决八数码的排列问题，用三种搜索方法，广度，深度，启发式搜索-Arrangement of eight digital solve the problem, with the three search methods, breadth, depth, heuristic search
8Puzzle_BFS
- 人工智能经典问题八数码的广度优先搜索算法实现。没有图形界面。-Classic problem of artificial intelligence, eight digital breadth-first search algorithm. No graphical interface.
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
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
- 解决八数码问题的广度优先搜索的源代码，编程语言为C-Solve the problem of eight digital breadth first search source code.For c++ programming language
eight
- 八数码问题也称为九宫问题。在3×3的棋盘，摆有八个棋子，每个棋子上标有1至8的某一数字，不同棋子上标的数字不相同。棋盘上还有一个空格，与空格相邻的棋子可以移到空格中。要求解决的问题是：给出一个初始状态和一个目标状态，找出一种从初始转变成目标状态的移动棋子步数最少的移动步骤。所谓问题的一个状态就是棋子在棋盘上的一种摆法。棋子移动后，状态就会发生改变。解八数码问题实际上就是找出从初始状态到达目标状态所经过的一系列中间过渡状态。 八数码问题一般使用搜索法来解。搜索法有广度优先搜索法、深度优先搜索法
jyyEight_Num_Fengart
- 八数码问题的解决,包括三种路径的查找最优解，例如：深度优先查找，广度优先查找。-Eight digital problem solving, including three kinds of paths to find an optimal solution, for example: depth-first search, breadth-first search.
source_code
- 八数码（启发式和广度优先搜索两种方法实现）+骑士巡游+比赛日程安排等经典问题的C++源代码-the source code of some classic problems, such as 8 puzzle question, Knight Parade, and Competition Schedule.
BFS-for-eight-digit
- 广度优先搜索实现八数码，源码和可执行文件， 未优化，带注释-Breadth-first search to achieve eight digital, source code and executable files, Unoptimized, annotated
Eight
- 八数码难题的java源代码，采用的是广度优先算法。-Eight puzzle java source code, using the breadth-first algorithm.
Test
- 八数码难题的搜索求解演示，该程序研究广度搜索算法。-Eight digital problem solving search demonstration, research breadth search algorithm.