Chapter 3, Problem 22E

Program Plan Intro

A* search algorithm:

• The A* search algorithm is a search algorithm used to search a particular node of a graph.
• A* algorithm is a variant of the best-first algorithm based on the use of heuristic methods to achieve optimality and completeness.
• The algorithm A* is an example of a best-first search algorithm.
• If a search algorithm has the property of optimality, it means that the best possible solution is guaranteed to be found. Here, the user wants the shortest path to the final state.

Recursive best search algorithm:

• The recursive best-first search algorithm or RBFS belongs to heuristic algorithms.
• The RBFS algorithm expands its frontier in best-first order.
• For determining the preference of one node over the other, the RBFS uses the problem specific information about the environment.