Course Content

Other Courses

Tribhuvan university CSIT 2074 Syllabus Artificial Intelligence Old Questions 2076 (new)

Artificial Intelligence - Old Questions

Question Answer Details
Syllabus Notes Old Questions Unit Wise Questions Question Bank

1. Construct a state space with appropriate heuristics and local costs. Show that Greedy Best First search is not complete for the state space. Also illustrate A* is complete and guarantees solution for the same state space.

10 marks
Asked in 2076 (new)

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...

Official Answer

No description available.

Here, when search reaches at node C it stucks in loop. So we can't reach at goal node. Therefore, Greedy Best First Search is not complete for the given state space.

No description available.