摘要
搜索策略的选择与设计是人工智能领域问题求解的核心问题之一,直接影响到问题求解过程中存储空间的占用和计算的复杂性,影响到问题求解的效率。在给出N皇后问题形式化描述和现有搜索算法的基础上,设计了3种解决N皇后问题的启发式算法,并将其与深度优先和宽度优先等搜索策略进行了分析和比较,得出了几点关于设计启发式算法的启示。
The selection and design of search strategy is one of the core issues on problem solving in the artificial intelligence field, and it directly influences the storage space usage and computation complexity in the process of problem solving and the efficiency of problem solving, In this paper, we first introduce the formal description of the N-Queens problem and present search algorithm. Then we design three heuristic algorithms to solve the problem. At last, we analyze these three algorithms, and compare them with the depth first strategy and the width first strategy, and present edification about the heuristic algorithm design.
出处
《计算机与网络》
2010年第24期51-53,共3页
Computer & Network
关键词
N皇后问题
搜索策略
深度优先策略
启发式算法
N-Queens Problem
search strategy
depth first strategy
heuristic algorithm
