AD IVS — Indus Valley School of Art and Architecture 2025

&"

~~ - }

hy OW

“

-»

- y

> e

é

we Lindt ont Search

0 What in the Hinal path for this search?

J \ < p © we always

b) What is the final path for this DFS search? If node has multiple successor ther : ’

expand the successors in increasing alphabetical order

) What iy the final path for this A* search? the heuristic

' - q © eaQyes, and Lomas io

0.5 | tart state 18 S, and the goal state is G. The transition costs are next ) the ¥ Ii % 3 ae are always

Pi . Assume LCS i :

timate, h, of the distance from the state to the goal is in the stale 5 node

broken by choosing the state which comes first alphabetically

( he'/ ) ,

o\ C /~=3 ~~

> 2 / yd h=3

4 h HK ) / po FJ

NATL INNS

| [ 7 o het 8 2 -

( 2 \ ? y/ sD (0)

S / KE iL rd ' op GJ

ol fore CONE Search

0) What is the Linal path for this search?

b) What 1s the final path for this DFS ¢

icurch? a en we always

pand the successor h? If & node has multiple successors, then we alv

Vin increasing alphabetic

) What iy the final path for this A* search?

0.5 | tart state 18 S, and the

timate, h, of th

al order

goal state is G. The transition costs are next to the edges, and the nEUnsuc

distance from the state to the goal is in the state’s node. Assume lies arc always

oken by choo ing the state which comes first alphabetically

[ ld

3 C _/~5 3

( hB ) oi yd r )

1 wv A 4 Vd ~~ Sb ee > 5

Van J ~G 2

(5) yo A [o0)

. Pe o > ad G

~~ 10

4 oh 6H

\ EJ

a) What is the order of states expanded using Depth First Search? Assume DFS terminates as soon

as it reaches the goal state,

b) What is the order of states expanded using Breadth First Search?

¢) What is the order of states expanded using Best First Search? Assume BFS terminates as soon as

it reaches the goal state.

d) What is the order of states expanded using A* search?

€) What is a least cost path from S to G7?

6. Yor a general search problem, state which of breadth-first search (BFS) or depth-first search (DFS)

is preferred under which of the following conditions:

a) A shallow solution (path from initial state to goal state) is preferred.

b) The search tree may contain large or possibly infinite branches.

¢) Very large memory space to store the search tree (or the queue) is available.

LK-4998/15-07-25