Introduction to Artificial Intelligence and Soft Computing Answer all the questions below. You are required to submit your answers in a single document file in PDF format.
Consider the graph in Figure Q1 which represents some of the European cities.
The distances between them are given in the following tables. The problem
requires finding the shortest path from Stockholm to Bucharest.
quires finding the shortest path from Stockholm to Bucharest.
a. What is the state space for this problem and what is its size? 4
b. Draw the search tree resulting from depth first search. Use graph search.
Answer the following questions:
i. How many nodes were expanded? Indicate the order of 4 expansion for the nodes by numbering them on your answer.
ii. What’s the size of the explored list? 2
iii. What’s the largest size of the frontier?
c. Draw the search tree resulting from uniform cost search. Use graph 4 search. Answer the following questions:
i. How many nodes were expanded? Indicate the order of 4 expansion for the nodes by numbering them on your answer. 2
ii. What’s the size of the explored list? 2
iii. What’s the largest size of the frontier?
Get Free Quote!
426 Experts Online