Uninformed (blind) search uses only the problem definition and no estimate of the distance to the goal. Breadth first, depth first and depth-limited search are all of that kind. A* search uses a heuristic estimate of the remaining cost, so it is an informed search.
More Search: informed, uninformed and adversarial questions
GATE 2026 DA Q30– Consider the game tree for a two-player turn-taking minimax game as shown in the figure.…
GATE 2025 DA Q43– Consider game trees Tree-1 and Tree-2 as shown. The first level is a MAX agent and the…
GATE 2025 DA Q44– The state graph shows the action cost along the edges and the heuristic function h…
GATE 2024 DA Q23– Let h 1 and h 2 be two admissible heuristics used in A* search. Which ONE of the following…
GATE 2024 DA Q25– Consider the following statement: In adversarial search, – pruning can be applied to game…
GATE 2024 DA Q44– Consider a state space where the start state is number 1. The successor function for the…