LEC NINE

Which of the following statements about local search algorithms is NOT true?

• The path to the goal is irrelevant, the goal state itself is the solution.

• The aim is to find the best state according to an objective function.

• Local search algorithms keep track of the paths and set of states that have been reached.

• Local search algorithms search from a start state to neighboring states.

What are the key advantages of local search algorithms?

• They use very little memory.

• They guarantee the optimal solution.

• They search from the goal state back to the start state.

Which local search algorithm is also known as "greedy local search"?

• Hill Climbing Search

• Simulated Annealing Search

• Depth-First Search

• Breadth-First Search

How can the Hill Climbing Search algorithm overcome the problem of getting stuck in local maxima?

• By performing a random restart.

• By implementing a bigger jump strategy.

• By increasing the memory capacity.

• By decreasing the search space.

What is the term used to describe a peak that is higher than each of its neighboring states but lower than the global maximum?

• Local maximum

• Plateau

• Global maximum

• Local minimum

True or False: Local search algorithms are useful for solving pure optimization problems.

• True

• False

What is the temperature in Simulated Annealing Search?

• The actual temperature of the environment

• The percentage of steps that can be taken leading to a rise in energy

• The number of possible states in the search space

• The objective function value

In Simulated Annealing Search, how is the probability of accepting a state with a worse objective function calculated?

• e^(ΔE/Temperature)

• e^(Temperature/ΔE)

• ΔE/Temperature

In simulated annealing search, what happens when ΔE (the difference in energy between the next state and the current state) is greater than 0?

• The probability of accepting the next state is always 1.

• The probability of accepting the next state decreases as ΔE increases.

• The probability of accepting the next state is always 0

Which local search algorithm uses a loop that continuously moves towards increasing value?

a. Simulated annealing search
b. Hill climbing search
c. Tabu search
d. Genetic algorithms

• Simulated annealing search

• Hill climbing search

• IDS