1. Breadth-first search a.

Best case

S F B S S O Z P R C S S A Z T S A Z T

T L T M S A

Z O T S Z

D=3 M= A,S,T,Z,F,O,R,A,A,L,A,O,B = 13 b. Worst case

A

T L A A

Z O R Z P C S S A Z T

S O S Z S F B

D=3 M = A,T,Z,S,L,A,A,O,R,A,O,F,T,M,S,Z,T,S,Z,T,S,Z,P,C,S,S,Z,T,S,Z,S,B = 32 2. Uniform-cost search

Z A O L

T A R F

S A O

D=3 M = A,Z,T,S,A,O,L,A,R,F,A,O,Z,T,S,Z,S,M,T,Z,T,S,S,P,C,S,B= 27

3. Depth-first search

S F O R A A

T L A

Z O

D= 3 M = A,S,F,B = 4

4. Depth-limited search D=6 M= A,T,L,T,L,T,L,A,M,D,L,A,T,L,A,S,O,A,R,F,Z,O,A,M,D,M,D,L,C,R,P,L, T,L,A,M,D,L,A,T,L,T,A,L,M,D,L,A,T,A,L,S,O,A,R,F,Z,O,A,Z,O,Z,O,A, S,O,A,R,F,A,,T,A,L,S,O,A,R,F,Z,O,A,S,O,Z,O,A,S,O,A,R,F,A,T,A,L,S, O,A,R,F,Z,O,A,R,C,R,P,P,B = 108

5. Iterative Deepening search L=0

A
L=1

S
L=2

F
L=3

F B S