試題詳解

37. Which of the following statements are true?
(A) State-space search is the most straightforward approach for planning algorithm.
(B) Forward state-space search is also called as regression planning.
(C) The complexity of minimax algorithm is the same as BFS.
(D) Hill climbing search is also called optimal local search because it grabs a good neighbor state without thinking ahead about where to go next.
(E) Average of path cost from start node to current node is utilized as the evaluation function in A* approach.