Professional Documents
Culture Documents
Tutorial 6
Tutorial 6
TUTORIAL SHEET 6
Q1. Prove uniform cost search is a special case of A* search. Q2. Compare uninformed search strategies. Q3. Show that iterative lengthening search algorithm is optimal for general path costs. Q4. What are optimal strategies used to describe Games? Q5. How alpha-beta search algorithm computes the same optimal move as minimax.