搜索资源列表
Astar
- A*算法实现的八数码问题，使用STL的优先队列及康拓展开的hash函数实现-A* algorithm implementation of the 8 digital issues, using priority queue in STL, and Courier function as hash function to implement
bashuma
- 八数码问题，用广度优先和深度优先算法实现。并且用mfc实现界面，让结果算法运行过程以动画显示。并附上实验报告-Depth-first search algorithm and the breadth-first search algorithm
Abashuma
- 很好用的用A*算法实现得到八数码，好用和很。
Puzzle-Killer-1.2
- 经典的八数码和十五数码问题的完美解决方案，对于任何情况均可以迅速出解，并且可以动态演示。并非用传统的A*或IDA*算法实现，效率远高于A*和IDA*算法。-The classic eight digital and 15 digital perfect solution for any situation can be quickly out of solution, and can be a dynamic presentation. Not achieve with traditional
EightNum
- 用A*算法实现了八数码问题，能很好地处理八数码问题，运用将牌不在位的个数描述八数码问题-With the A* algorithm eight digital issues, can handle eight digital good, the use of the card is not in position number eight digital descr iption
EightNum_henji
- 用A*算法实现了八数码问题，用不在位的将牌数作为启发函数，很好地处理了八数码问题-With the A* algorithm eight digital issues, not bit by the number of licenses as heuristic function, a good deal of the eight digital
A--algorithm-eight-digital-problem
- 这是一个领用人工智能中的A*算法求解八数码问题的完整实现，包含多种启发函数。-This is A recipients A* algorithm in artificial intelligence eight digital problem complete implementation, contain A variety of enlightening function.
PuzzleProblem
- 八数码问题的四种不同股价函数的实现，采用a星算法实现-Eight digital
EightCode
- 这是八数码的显示，通过深度优先算法实现最优解的寻找。-This is the eight digital display, search for the optimal solution to achieve by depth-first algorithm.
bashuma
- 在visual c++环境中实现八数码的算法，程序采用链表的形式和A*算法来实现，初始输入可以通过改变文件中的.txt来改变。-In the visual c++ environment to achieve eight digital algorithm, the program using the form of a list and A* algorithm to achieve, the initial input can change the file. Txt to change.
8数码
- 实现八数码问题的一个小算法平台，其中包括深度优先、广度优先、最好优先算法。(A small algorithm platform for eight digital problems, including depth first, breadth priority and best priority algorithm.)