Course: Artificial Intelligence

Please solve this correctly.

You have to answer all.

Don't copy and paste. Give me the correct answer, please.

5. a. Define Random Restart Hill Climbing search algorithm. What are the advantages over the greedy version? [2] b. If the temperature decreases in simulated annealing, how the probability of bad moves changes? [1] c. If the temperature is zero all the time in simulated annealing, how the search will behave? Which version of greedy search it will resemble then? Explain your answer. [2] d. The mutation step in genetic algorithm increases diversification - Explain. [1]