Give the name of the algorithm that results from each of the following special cases:
-
Local beam search with $k = 1$.
-
Local beam search with one initial state and no limit on the number of states retained.
-
Simulated annealing with $T = 0$ at all times (and omitting the termination test).
-
Simulated annealing with $T=\infty$ at all times.
-
Genetic algorithm with population size $N = 1$.
Answer
Improve This Solution
View Answer