The document discusses different types of searching algorithms, including uninformed and informed searching. It provides examples of uninformed searching algorithms like breadth-first search (BFS), depth-first search (DFS), and uniform cost search (UCS). BFS explores all nodes level-by-level, DFS explores nodes as deep as possible first before backtracking, and UCS finds the lowest total cost path using a priority queue.

1. ntelligent
earching
lgorithm
I
S
A

2. ISA
Types of searching algorithm
Uninformed
searching
Informed
searching

3. ISA
Types of searching algorithm
Uninformed
searching
Informed
searching
• explore the search space
without any additional
knowledge about the
goal state
• visit nodes in a
systematic manner, such
as by visiting all possible
nodes or states in the
search space

4. ISA
Types of searching algorithm
Informed
searching
Uninformed
searching
• use additional
information or heuristics
to guide the search
process
• Heuristics are estimates
of the cost or distance to
the goal state

5. ISA
3
Uniform cost search
(UCS)
2
Depth first search
(DFS)
1
Breadth first search
(BFS)
Uninformed
searching
 explores all nodes
at the same level
before moving on
to the next level
 find the shortest
path between two
nodes if one exists

6. ISA
3
Uniform cost search
(UCS)
2
Depth first search
(DFS)
1
Breadth first search
(BFS)
Uninformed
searching
 explores all nodes at
the same level
before moving on to
the next level
 find the shortest
path between two
nodes if one exists
 explores as far as
possible along each
branch before
backtracking
 are not guaranteed
to find the shortest
path

7. ISA
3
Uniform cost search
(UCS)
2
Depth first search
(DFS)
1
Breadth first search
(BFS)
Uninformed
searching
 explores all nodes
at the same level
before moving on
to the next level
 find the shortest
path between two
nodes if one exists
 explores as far as
possible along each
branch before
backtracking
 are not guaranteed
to find the shortest
path
 expands nodes in
order of their path
cost, which is the total
cost of the path from
the start node to the
current node
 are not guaranteed to
find the shortest path

8. Breadth first search
(BFS)
A
C
B
D
E
F
G
Initial
state
Goal

9. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list

10. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A

11. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A

12. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A

13. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A
B
C

14. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A
B C

15. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A
B C

16. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B
C
D
E

17. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B
C D E

18. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B
C D E

19. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C
D E
D
F

20. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C
D E D F

21. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C
D E D F

22. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C D
E D F
C
F

23. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C D
E D F C F

24. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C D
E D F C F

25. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C D E
D F C F
G

26. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C D E
D F C F G

27. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C D E
D F C F G

28. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C D E
F C F G

29. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C D E
F C F G

30. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C D E F
C F G
G

31. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C D E F
C F G G

32. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C D E F
C F G G

33. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C D E F
F G G

34. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C D E F
F G G

35. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C D E F
G G

36. Breadth first search
(BFS)
A C
B
D
E
F
G
Queue
Visited list
A B C D E F
G G
The Goal

37. Breadth first search
(BFS)
A
C
B
D
E
F
G

38. Breadth first search
(BFS)
A B E G
Solution Path

39. ISA
3
Uniform cost search
(UCS)
2
Depth first search
(DFS)
1
Breadth first search
(BFS)
Uninformed
searching

40. Depth first search
(DFS)
A
C
B
D
E
F
G
Initial
state
Goal

41. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack

42. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A

43. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A

44. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A

45. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B

46. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B

47. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B

48. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B
D
E

49. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B
D
E

50. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B
D
E

51. Breadth first search
(BFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B D
E
C
F

52. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B D
E
C
F

53. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B D
E
C
F

54. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B D
E
C
F
F

55. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B D
E
C
F
F

56. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B D
E
C
F
F

57. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B D
E
C
F
F
G

58. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B D
E
C
F
F
G

59. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B D
E
C
F
F
G

60. Depth first search
(DFS)
A C
B
D
E
F
G
Visited list
Stack
A
C
B D
E
C
F
F
G
The
Goal

61. Depth first search
(DFS)
A
C
B
D
E
F
G

62. Depth first search
(DFS)
A
C
B
D
F
G

63. Depth first search
(DFS)
A C
B D F G
Solution path

64. ISA
3
Uniform cost search
(UCS)
2
Depth first search
(DFS)
1
Breadth first search
(BFS)
Uninformed
searching

65. Uniform cost search
(UCS)
A
C
B
D
E
F
G
Initial
state
Goal
4
1
2
6
4
8
3
8
2

66. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2

67. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A

68. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A
C
B

69. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A
C
B

70. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A
C
B
1 4

71. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A
C4
B1

72. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A
C4
B1

73. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1
C4 D E
1+2=3 1+6=7

74. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1
C4 D3 E7

75. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1
C4
D3 E7

76. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1
C4
D3 E7

77. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1
C4
D3
E7
F
C

78. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1
C4
D3
E7 F
C
1+2+3
= 6
1+2+4
= 7

79. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1
C4
D3
E7 F7
C6

80. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1
C4
D3
E7 F7
C6

81. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1
C4
D3
E7 F7
C6

82. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3
E7 F7
C6 D F
4+3=7 4+8=12

83. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3
E7 F7
C6 D7 F12

84. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3
E7 F7
C6 D7 F12

85. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3
E7 F7
C6 D7 F12

86. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3
E7 F7
C6
D7 F12
F

87. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3
E7 F7
C6
D7 F12
F
1+2+3+8=14

88. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3
E7 F7
C6
D7 F12
F14

89. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3
E7 F7
C6
D7 F12 F14

90. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3
E7 F7
C6
D7 F12 F14

91. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3 E7
F7
C6
D7 F12 F14
G

92. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3 E7
F7
C6
D7 F12 F14
G
1+6+8=15

93. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3 E7
F7
C6
D7 F12 F14
G15

94. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3 E7
C6
F7 D7 F12 F14 G15

95. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3 E7
C6
F7 D7 F12 F14 G15

96. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3 E7
C6 F7
D7 F12 F14 G15
G

97. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3 E7
C6 F7
D7 F12 F14 G15
G
1+2+4+2=9

98. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3 E7
C6 F7
D7 F12 F14 G15
G9

99. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3 E7
C6 F7
D7 F12 F14 G15
G9

100. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3 E7
C6 F7
D7 F12 F14 G15
G9
F

101. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3 E7
C6 F7 D7
F12 F14 G15
G9
F
4+3+4
=11

102. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3 E7
C6 F7 D7
F12 F14 G15
G9
F11

103. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3 E7
C6 F7 D7
F12 F14 G15
G9 F11

104. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
4
1 2
6
4
8
3
8
2
A B1 C4
D3 E7
C6 F7 D7
F12 F14 G15
G9 F11
The Goal

105. Uniform cost search
(UCS)
A
C
B
D
E
F
G
4
1 2
6
4
8
3
8
2
Cost = 9

106. Uniform cost search
(UCS)
A B D F G
Cost = 9
Solution path

107. Uniform cost search
(UCS)
A
C
B
D
E
F
G
1
1
1
1
1
1
1
1
1

108. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
1
1 1
1
1
1
1
1
1

109. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A
1
1 1
1
1
1
1
1
1

110. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A
C
B
1
1 1
1
1
1
1
1
1

111. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A
C
B
1
1 1
1
1
1
1
1
1

112. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A
C
B
1 1
1
1 1
1
1
1
1
1
1

113. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A
C1
B1
1
1 1
1
1
1
1
1

114. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
3
A
C1
B1
1
1 1
1
1
1
1
1
1

115. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1
C1 D E
1+1=2 1+1=2
1
1 1
1
1
1
1
1
1

116. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1
C1 D2 E2
1
1 1
1
1
1
1
1
1

117. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1
C1 D2 E2
1
1 1
1
1
1
1
1
1

118. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1
C1 D2 E2
1
1 1
1
1
1
1
1
1

119. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1
D2 E2
1
1 1
1
1
1
1
1
F
D
1

120. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1
D2 E2
1
1 1
1
1
1
1
1
F
D
1+1=2 1+1=2
1

121. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1
D2 E2
1
1 1
1
1
1
1
1
F2
D2
1

122. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1
D2 E2
1
1 1
1
1
1
1
1
F2
D2
1

123. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1
D2 E2
1
1 1
1
1
1
1
1
F2
D2
1

124. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2
E2
1
1 1
1
1
1
1
1
F2
D2
F
C
1

125. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2
E2
1
1 1
1
1
1
1
1
F2
D2
F
C
1+1+1
= 3
1+1+1
= 3
1

126. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2
E2
1
1 1
1
1
1
1
1
F2
D2
F3
C3
1

127. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2
E2
1
1 1
1
1
1
1
1
F2
D2 F3
C3
1

128. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2
E2
1
1 1
1
1
1
1
1
F2
D2 F3
C3
1

129. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2
D2 F3
C3
G
1

130. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2
D2 F3
C3
G
1+1+1
= 3
1

131. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2
D2 F3
C3
G3
1

132. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2
D2 F3
C3 G3
1

133. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2
D2 F3
C3 G3
1

134. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2 F3
C3 G3
1

135. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2
F3
C3 G3
1
G

136. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2
F3
C3 G3
1
G
1+1+1
= 3

137. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2
F3
C3 G3
1
G3

138. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2
F3
C3 G3
1
G3

139. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2
F3
C3 G3
1
G3

140. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2
F3
C3
G3
1
G3
F

141. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2
F3
C3
G3
1
G3
F
1+1+1+1
= 4

142. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2
F3
C3
G3
1
G3
F4

143. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2
F3
C3
G3
1
G3 F4

144. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2
F3
C3
G3
1
G3 F4

145. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2 F3
C3
G3
1
G3 F4
G

146. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2 F3
C3
G3
1
G3 F4
G4

147. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2 F3
C3
G3
1
G3 F4 G4

148. Uniform cost search
(UCS)
A C
B
D
E
F
G
Priority Queue
Visited list
A B1 C1 D2 E2
1
1 1
1
1
1
1
1
F2 F3
C3
G3
1
G3 F4 G4
The Goal

149. Uniform cost search
(UCS)
A
C
B
D
E
F
G
1
1 1
1
1
1
1
1
1
Cost = 3

150. Uniform cost search
(UCS)
A B E G
Cost = 3
Solution path

151. block
block
The Game

152. B B B B B B
B B B B
B S S B
B B B H B B
B F H B
B B
B B B B B B
The Game

153. B B B B B B
B B B B
B S S B
B B B H B B
B F H B
B B
B B B B B B