What is the main focus of local search algorithms?

• Finding the optimal path to a solution

• Using extensive memory

• Operating on the current state only

• Exploring all possible states

Which of the following is a problem associated with hill climbing?

• Global maxima

• High memory usage

• Local maxima

• Infinite state spaces

What does simulated annealing allow that hill climbing does not?

• Faster convergence

• Only uphill moves

• No randomness in decision making

• Downhill moves to escape local maxima

What is the primary advantage of local beam search?

• Explores multiple paths at once

• Requires less memory than BFS

• Always finds the optimal solution

• Uses a fixed-size memory window

In the context of genetic algorithms, what does 'crossover' refer to?

• Selecting the best individuals

• Exchanging gene segments between parents

• Random changes to gene bits

• Creating the initial population

What is a contingency plan in AI?

• A plan that requires no observations

• A fixed sequence of actions

• A method for deterministic actions

• A strategy with multiple options

What is the purpose of the AND-OR search tree?

• To avoid cycles in search

• To ensure optimal solutions

• To explore all possible states

• To solve problems by breaking them into smaller sub-problems

What is the main characteristic of a perfect information game?

• Players cannot see each other's moves

• Random events influence the game

• Players have complete knowledge of the game state

• Players act simultaneously

Which algorithm is used to find the optimal move in adversarial games?

• Hill Climbing

• Simulated Annealing

• Minimax Algorithm

• Genetic Algorithm

What does alpha-beta pruning do?

• Increases the search space

• Eliminates the need for evaluation functions

• Reduces the search space by cutting off branches

• Guarantees finding the optimal solution