Artificial Intelligence, a modern approach
Chapter 4 with questions and well verified
answers actual exam!!! 2026
Local search and optimization problems - ANSWER -•Hill-climbing search
•Simulated annealing search
•Local beam search
•Genetic algorithms
In local search problems, state space = set of "complete" configurations; the goal is to find best
configuration satisfying constraints.
•These problems are unlike the search problems from previous classes:
- The path to the goal is irrelevant
-- all you care about is the final configuration
- These are often optimization problems in which you find the best state according to an
objective function
local search algorithms - ANSWER -•Two strategies for choosing the state to visit next
•Hill climbing
•Simulated annealing
•Then, an extension to multiple current states
:•Local Beam search
•Genetic algorithms
Chapter 4 with questions and well verified
answers actual exam!!! 2026
Local search and optimization problems - ANSWER -•Hill-climbing search
•Simulated annealing search
•Local beam search
•Genetic algorithms
In local search problems, state space = set of "complete" configurations; the goal is to find best
configuration satisfying constraints.
•These problems are unlike the search problems from previous classes:
- The path to the goal is irrelevant
-- all you care about is the final configuration
- These are often optimization problems in which you find the best state according to an
objective function
local search algorithms - ANSWER -•Two strategies for choosing the state to visit next
•Hill climbing
•Simulated annealing
•Then, an extension to multiple current states
:•Local Beam search
•Genetic algorithms
