search34
TRANSCRIPT
Problem Solving and Search
Lecture 3
Uniform Cost SearchUniform Cost Search* Similar to Breath-First.* Pursues the path with less accumulated cost.
* Uniform Cost: minimizes g(n) = path_cost(n)* Breath-First: minimizes g(n) = depth(n)
Search
31 15
A
CB D
A
B C D
F
153
5
110
1
E
1
31
10
15
5
A
CB D
F E
F
31
10
15
5
A
CB D
F E
10
F
1
