Question 21
Uniform Cost Search (UCS) expands nodes in order of increasing path cost g(n) using which data structure?
UCS stores fringe nodes in a priority queue sorted by cumulative path cost g(n) from the start node.
Uniform Cost Search (UCS) expands nodes in order of increasing path cost g(n) using which data structure?
UCS stores fringe nodes in a priority queue sorted by cumulative path cost g(n) from the start node.
In adversarial game playing, which algorithm prunes branches of the game tree that cannot affect the final decision?
$\Alpha-\Beta pruning reduces$ the number of nodes evaluated by the Minimax algorithm by stopping evaluation of a move when at least one possibility has been found that proves the move to be worse than a previously examined move.
What is a major limitation of Depth-First Search in infinite state spaces?
DFS explores down a single branch indefinitely; if the state space contains infinite depth paths or loops without depth limits, DFS will never terminate.
Bidirectional search reduces search time from O($b^d)$ to O($b^{d/2$}) by:
Bidirectional search runs two concurrent searches-one forward from start and one backward from goal-stopping when the two search frontiers intersect.
In Artificial Intelligence, PEAS representation for an intelligent agent stands for:
PEAS stands for Performance measure, Environment, Actuators, and Sensors, which define the task environment for an AI agent.