anasidrees848Lv1

2 Apr 2024

Use the following tree to indicate the order that nodes are expanded, for Uniform-cost search and greedy best-first searches. Assume that A is the start node and G (color box) is the only goal node. Here, path costs are shown to the right of each path.
g = cost of path so far, h = estimate of remaining cost to goal, f = estimate of total path cost (evaluation function).
CS CamScan
g=0
h=100
A f=100
g=80
g=25
h=30
f=110
5
B
D
g=85
h=35
f=120
F
g=30
10
80
g=90
E h=20
f=110
5
25
h=55
Cf=80
45
18=70
Gh=0
h=80
f=110
f=70