搜索资源列表
EightCode_BFS
- 用广度优先遍历实现八数码的自动求值,写出到文件,从文件读入时有小问题-Breadth-first traversal is used to implement the eight digital automatic evaluation, to write to a file, read from the file have a little problem
number1
- 八数码的C++解法,广度优先算法完成,人工智能中难题-eight digital C solution, the breadth- first algorithm. AI problems
JAVA-Eight-digital-problem
- 九宫排字问题(又称八数码问题)是人工智能当中有名的难题之一。问题是在 3×3 方格盘上,放有八个数码,剩下第九个为空,每一空格其上下左右的数码可移至空格。问题给定初始位置和目标位置,要求通过一系列的数码移动,将初始位置转化为目标位置。本文介绍用普通搜索方法、双向广度搜索和启发式搜索如何缩短寻找路径的时间,以及各算法间的利与弊。-Jiugong typesetting problem (also known as eight digital problem) is one of famous pr
eightnum
- 八数码游戏c实现 控制台 可以自动显示走法 广度优先搜索-Eight digital game c implementation
digital
- 利用广度优先搜索算法解决八数码难题,寻找从初始状态变换到目标状态的最优解-Use breadth-first search algorithm to solve eight digital problem, seek transformation initial state to target state optimal solution
8puzzle
- 八数码实现程序。支持A*算法、广度优先算法、深度优先算法。可以实现任意初始状态下八数码问题的实现。人工智能搜索原理的入门例程-Eight digital realization of the program. Support A* algorithm, breadth-first algorithm, depth-first algorithm. Can achieve any initial state eight digital problem. Artificial Intelligenc
ArtificialIntelligenceProject
- 有界深度优先搜索 广度优先搜索 等策略实现九宫格 八数码问题的智能搜索-Bounded depth-first search strategy to achieve breadth-first search and other squares eight digital intelligent search
8code
- 八数码问题MFC实现,包括深度,广度及A算法。界面为MFC(Eight digital problems MFC implementation, including depth, breadth and A algorithm. The interface is MFC)
559228
- 使用广度优先算法快速解决八数码问题,有效,很好用哦()
ysuutas
- 使用广度优先算法快速解决八数码问题,有效,很好用哦()
EightPuzzle
- 八数码 深度优先搜索 广度优先搜索 图搜索策略(eightpuzzle Eight digital depth first search, breadth first search graph search strategy)