CT 653 · Chapter 3
Artificial Intelligence past question
3.2 Informed search techniques-hill climbing, best first search, greedy search, A* search Adversarial search techniques-minimax procedure, alpha beta procedure
Define the terms admissibility and optimality in the context of A* search. Under what conditions is A* guaranteed to be both admissible and optimal? Provide justification for your answer.