Course: Artificial Intelligence

Please solve this correctly.

You have to answer all.

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

a. Suppose you are trying to solve the 8 queens problem using greedy hill climbing search. How will the performance be affected if you allow sideways move (choose equal valued successors if better ones are not generated)? [2] b. What is the difference between Randomly Restarting Hill Climbing Search k times and local beam search with a beam size of k ? [2] c. What will happen in the local beam search if we set the beam size(k) to be 1 ? [1] d. What is the role of the temperature, T in Simulated Annealing? How do chances of taking bad moves change with the value of T ? [2]