AI ML Answers
AI ML Answers
Informed Search:
- Uses heuristics to guide the search.
- Faster and more efficient.
- Examples: A* Search, Greedy Best-First Search.
7(a). A* Algorithm - Is the A* Algorithm able to find a suitable solution? Justify your answer.
Yes, the A* algorithm can find an optimal solution in the state-space graph because it
combines the best features of BFS (completeness) and greedy search (efficiency). It uses the
function f(n) = g(n) + h(n), ensuring optimality if h(n) is admissible. It is widely used in
pathfinding and AI planning.
7(b). Explain Alpha-Beta Pruning with a suitable example. How is it different from Min-Max
Algorithm?
Alpha-Beta pruning is an optimization technique for the Minimax algorithm used in game-
playing AI to reduce the number of nodes evaluated in a decision tree. It prunes branches
that will not affect the final decision. Unlike Minimax, which evaluates all possible moves,
Alpha-Beta Pruning skips unnecessary calculations, making it more efficient.