爬山和 A* 有什么区别？
what is the difference between Hill climbing and A*?
在人工智能中，这些算法非常流行。我尝试寻找解决 8puzzle 问题的方法，它们似乎都有相似的方法。谁能解释一下有什么区别？
Algorithms like weighted A* (Pohl 1970) systematically explore the
search space in ’best’ first order. ’Best’ is defined by a node
ranking function which typically considers the cost of arriving at a
node, g, as well as the estimated cost of reaching a goal from a node,
h. Some algorithms, such as A∗ ǫ (Pearl and Kim 1982) also consider
the distance of a node from the goal, d. Hill-climbing algorithms are
less deliberative; rather than considering all open nodes, they expand
the most promising descendant of the most recently expanded node until
they encounter a solution.
在人工智能中，这些算法非常流行。我尝试寻找解决 8puzzle 问题的方法，它们似乎都有相似的方法。谁能解释一下有什么区别？
Algorithms like weighted A* (Pohl 1970) systematically explore the search space in ’best’ first order. ’Best’ is defined by a node ranking function which typically considers the cost of arriving at a node, g, as well as the estimated cost of reaching a goal from a node, h. Some algorithms, such as A∗ ǫ (Pearl and Kim 1982) also consider the distance of a node from the goal, d. Hill-climbing algorithms are less deliberative; rather than considering all open nodes, they expand the most promising descendant of the most recently expanded node until they encounter a solution.