So the chosen move can be far from optimal. Of course iterative deepening can be used, and solve partially this problem.
这样被选的棋步可能比最优棋步差得远,当然,可以用迭代深化来部分解决这个问题。
The running time of iterative-deepening-A~*(IDA~*) algorithm is analyzed with heuristic function of the problem space and the effect of the function is to reduce the actual search depth.
以问题空间上启发值的分布为启发函数的特征来分析迭代延伸A* (IDA~** )的时间复杂度,使启发函数的作用相当于减小有效的搜索深度。
The running time of iterative-deepening-A~*(IDA~*) algorithm is analyzed with heuristic function of the problem space and the effect of the function is to reduce the actual search depth.
以问题空间上启发值的分布为启发函数的特征来分析迭代延伸A* (IDA~** )的时间复杂度,使启发函数的作用相当于减小有效的搜索深度。
应用推荐