Computer Science, asked by thfkz5105, 10 months ago

Difference between hill climbing and best first search

Answers

Answered by yadavshubhu5150
0

Answer:

Explanation:

So unlike BFS, the 'value' of the parent node is also taken into account. If we can't go higher, we just give up. ... In simple hill climbing, the first closer node is chosen, whereas in steepest ascent hill climbing all successors are compared and the closest to the solution is chosen.

Read more on Brainly.in - https://brainly.in/question/6452361#readmore

Similar questions