Question 31
If a heuristic function h(n) is consistent, then h(n) is also guaranteed to be:
Every consistent heuristic function is automatically admissible (though not all admissible heuristics are consistent).
If a heuristic function h(n) is consistent, then h(n) is also guaranteed to be:
Every consistent heuristic function is automatically admissible (though not all admissible heuristics are consistent).
In graph search, A* search is guaranteed to find the optimal solution if the heuristic function h(n) is:
For graph search (where visited nodes are discarded), consistency is required to guarantee optimal solutions without re-opening closed nodes.
Which local search algorithm continuously moves in the direction of increasing value/elevation to find a peak, but can get stuck in local maxima?
Hill Climbing evaluates neighbor states and moves greedy uphill; if surrounded by lower states, it gets trapped in local maxima.
Which component of an Expert System contains the domain-specific facts and rules rules used to solve problems?
The Knowledge Base in an expert system stores domain knowledge, including facts, assertions, and IF-THEN rules.
Simulated Annealing avoids getting trapped in local maxima by:
Simulated Annealing borrows from metallurgy, accepting suboptimal downhill moves with probability $\exp(-delta_E / T)$, where temperature T decreases gradually.