Search Algorithms in AI

Which of the following is NOT explicitly mentioned as a type of search algorithm used in AI?

• Uninformed (blind) search

• Informed (heuristic) search

• Quantum search

• Adversarial search

Uninformed (Blind) Search algorithms explore the search space with:

• Complete knowledge of the problem's goal.

• Heuristics to guide the search.

• No knowledge of the problem's structure or goal.

• Prioritized paths based on estimated distance.

Which uninformed search strategy explores all neighbors at the current level before moving to the next?

• Depth-First Search (DFS)

• Uniform Cost Search

• Breadth-First Search (BFS)

• Bidirectional Search

The Depth-Limited Search is a variation of which algorithm, used to prevent infinite loops?

• Breadth-First Search (BFS)

• Iterative Deepening Depth-First Search

• Depth-First Search (DFS)

• Uniform Cost Search

Which uninformed search strategy prioritizes expanding nodes with the lowest path cost?

• Breadth-First Search (BFS)

• Depth-First Search (DFS)

• Bidirectional Search

• Uniform Cost Search

Informed (Heuristic) Search algorithms leverage what to guide the search process?

• Random exploration

• Problem-specific knowledge (heuristics)

• Exhaustive search of all possibilities

• Only the cost from the start node

In Informed (Heuristic) Search, what do heuristics estimate?

• The exact cost from the start node to the current node.

• The distance from a node to the goal.

• The total number of nodes in the search space.

• The optimal move for an opponent.

Which informed search algorithm selects the node that appears closest to the goal based on the heuristic?

• A* Search

• Hill Climbing

• Greedy Best-First Search

• Simulated Annealing

A Search combines the cost from the start to the current node with what other estimate?

• The exact cost to the goal.

• The heuristic estimate to the goal.

• The number of visited nodes.

• The branching factor of the search tree.

Which informed search algorithm iteratively moves towards better solutions by exploring neighboring states but can get stuck in local optima?

• A* Search

• Simulated Annealing

• Hill Climbing

• Greedy Best-First Search