Figure 1.8 shows a search tree where each node represents one search state and is tagged with the value the evaluation function. In what order willthese states visited by hill-climbing search?

Transcribed Image Text:

0.1 a b. 2.5 1.4 2.3 f 0.3 k 2.1 2.0 0.2 2.0 1.0 3.2 1.5 3.5 Fig. 1.8 Determine the order in which these search states are visited by heuristic search algorithms. The numbers next to the "boxes" give the value the evaluation function for the individual search states 0.1 a b. 2.5 1.4 2.3 f 0.3 k 2.1 2.0 0.2 2.0 1.0 3.2 1.5 3.5 Fig. 1.8 Determine the order in which these search states are visited by heuristic search algorithms. The numbers next to the "boxes" give the value the evaluation function for the individual search states

Answer rating: 100% (QA)

The order of states visited is as follows ... View the full answer