’
FUNDAMENTALS OF ARTIFICIAL INTELLIGENCE S
\ ID Number j
, 1. (20pts) Wou are given a search tree with one
node 1S a start state S and another node ed
as a goal state G. Number the nodes in according the order i hich they will
be expanded (not the order in whicl they are generated). Wher order of expansion is
arbitrary, assume that nodes are expand
ed from left tc t
5pts Breadth First Search.
S i
i |
£ |
P
P~
o -
by
Lxr
()
D
5pts Depth First Search.
FUNDAMENTALS OF ARTIFICIAL INTELLIGENCE S
\ ID Number j
, 1. (20pts) Wou are given a search tree with one
node 1S a start state S and another node ed
as a goal state G. Number the nodes in according the order i hich they will
be expanded (not the order in whicl they are generated). Wher order of expansion is
arbitrary, assume that nodes are expand
ed from left tc t
5pts Breadth First Search.
S i
i |
£ |
P
P~
o -
by
Lxr
()
D
5pts Depth First Search.
