Question 91
In CSP Backtracking Search, the Degree Heuristic selects the variable that is:
Degree Heuristic acts as a tie-breaker for MRV, picking the variable with the highest degree of constraints on remaining unassigned variables.
In CSP Backtracking Search, the Degree Heuristic selects the variable that is:
Degree Heuristic acts as a tie-breaker for MRV, picking the variable with the highest degree of constraints on remaining unassigned variables.
The Least Constraining Value (LCV) heuristic in CSPs is used to order domain values for a selected variable by picking the value that:
LCV orders domain values to maximize flexibility, selecting the value that leaves the maximum number of choices for remaining variables.
Which AI search technique combines A* search memory efficiency by performing depth-first search up to increasing heuristic cost limits f(n)?
IDA* conducts a series of depth-first search passes, using f(n) = g(n) + h(n) cutoff thresholds to find optimal goals with linear memory O(bd).
In AI Automated Planning, the classical STRIPS language represents planning actions using which three components?
STRIPS actions specify Preconditions (states required to execute), Add List (literals made true), and Delete List (literals made false).
In Planning Graphs (e.g., Graphplan algorithm), Mutex (Mutual Exclusion) links between two actions at the same level indicate that:
Mutex links identify incompatible action pairs resulting from inconsistent effects, interference, or competing preconditions.