QUESTION 6-10
Problem 1 - State True or False (10x1.5 = 15 marks) 1. A simple-reflex agent will maximise the expected performance measure in a partially observable environment. FALSE 2. In a deterministic environment, if you are in state So and you perform action A, the probability of reaching the next state S₁ is 1. FALSE 3. A program implementing breadth-first search can be easily converted to depth-first search just by changing the frontier implementation from a FIFO queue to a LIFO queue. TRUE 4. Depth-first search with repeated state check can guarantee to find the optimal solution. TRUE 5. A* search will always expand fewer search nodes than uniform cost search. FALSE 6. Alpha-beta pruning with a heuristic evaluation function yields an optimal playing strategy against an optimal opponent. 7. There is a sound and complete inference algorithm for propositional logic. 8. First-order logic has more expressive power than propositional logic. | 9. Partial Order Planning explores the space of plans without committing to a totally ordered sequence of actions. 10. A and B are independent if and only if P(A/B)=P(A)P(B)
ANSWE Problem 1 - State True or False (10x1.5 = 15 marks) 1. A simple-reflex agent will maximise the expected performance meas
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am