So the chosen move can be far from optimal. Of course iterativedeepening can be used, and solve partially this problem.
这样被选的棋步可能比最优棋步差得远,当然,可以用迭代深化来部分解决这个问题。
2
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.