| 八数码问题的搜索算法比较 |
| |
| 引用本文： | 欧阳林艳.八数码问题的搜索算法比较[J].洛阳师范学院学报,2011,30(8):69-71. |
| |
| 作者姓名： | 欧阳林艳 |
| |
| 作者单位： | 福州大学阳光学院计算机工程系,福建福州,350015 |
| |
| 摘 要： | 搜索策略是人工智能研究的主攻方向之一,采用不同的搜索策略在求解问题的过程中也会存在差异.通过对于八数码的搜索求解分析,采用盲目搜索中的广度优先搜索算法和启发式搜索中的A*算法进行实现,将广度优先搜索算法与A*算法进行比较,从而评价这两种搜索算法的优劣性.
|
| 关 键 词： | 搜索策略 广度优先搜索 启发式搜索 A*算法 |
Searching Algorithms Comparison of the Eight Digital Problem |
| |
| OUYANG Lin-yan.Searching Algorithms Comparison of the Eight Digital Problem[J].Journal of Luoyang Teachers College,2011,30(8):69-71. |
| |
| Authors: | OUYANG Lin-yan |
| |
| Institution: | OUYANG Lin-yan(Computer Engineering Department,Sunshine College of Fuzhou University,Fuzhou 350015,China) |
| |
| Abstract: | Search strategy is one of the main directions in the artificial intelligence research.Using different search strategies in the process of solving problem also may have differences.Through the analysis of the search solution for eight digital,the Breadth-first search algorithm,a kind of the blind searching,and A * algorithm,which is one of the heuristic search,are used to implement it.Breadth-first search algorithm and A * algorithm are compared to evaluate the superiority between these two search algorithms... |
| |
| Keywords: | search strategy breadth-first search heuristic search A* algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
