Question

A H(G) = 20 10 9 15 D H(G) = 8 7 6 7 S H(G) = 25 C H(G) = 14 9 8 5 4 E H(G) = 3 G H(G) = 0 B H(G) = 22 20 8 10 6 20 X H(G) =30 20 Y H(G) =20 F H(G)=9 H H(G) = 2 Q2. From the figure above, the goal is to reach the node G from the start node S. Giving that, if you are visiting node A, the estimated heuristic value from A to G is h(G) = 20, and the cost value from node A to node S is g(S) = 10. 1. Apply the A* heuristic algorithm to find the best path from S to G. (show all the steps) 2. Solve this problem using Greedy algorithm. 3. Compare between the two solutions. 4. Build the search tree and apply the Depth-first search. a. The node should appear just one time. b. The expanded nodes should be in order (i.e., from S, the children will be ordered A then B, and from A the children will be C then D)

          A
H(G) = 20
10
9
15
D
H(G) = 8
7
6
7
S
H(G) = 25
C
H(G) = 14
9
8
5
4
E
H(G) = 3
G
H(G) = 0
B
H(G) = 22
20
8
10
6
20
X
H(G) =30
20
Y
H(G) =20
F
H(G)=9
H
H(G) = 2
Q2. From the figure above, the goal is to reach the node G from the start node S. Giving that, if you
are visiting node A, the estimated heuristic value from A to G is h(G) = 20, and the cost value from
node A to node S is g(S) = 10.
1. Apply the A* heuristic algorithm to find the best path from S to G. (show all the steps)
2. Solve this problem using Greedy algorithm.
3. Compare between the two solutions.
4. Build the search tree and apply the Depth-first search.
a. The node should appear just one time.
b. The expanded nodes should be in order (i.e., from S, the children will be ordered A
then B, and from A the children will be C then D)

A
H(G) = 20
10
9
15
D
H(G) = 8
7
6
7
S
H(G) = 25
C
H(G) = 14
9
8
5
4
E
H(G) = 3
G
H(G) = 0
B
H(G) = 22
20
8
10
6
20
X
H(G) =30
20
Y
H(G) =20
F
H(G)=9
H
H(G) = 2
Q2. From the figure above, the goal is to reach the node G from the start node S. Giving that, if you
are visiting node A, the estimated heuristic value from A to G is h(G) = 20, and the cost value from
node A to node S is g(S) = 10.
1. Apply the A* heuristic algorithm to find the best path from S to G. (show all the steps)
2. Solve this problem using Greedy algorithm.
3. Compare between the two solutions.
4. Build the search tree and apply the Depth-first search.
a. The node should appear just one time.
b. The expanded nodes should be in order (i.e., from S, the children will be ordered A
then B, and from A the children will be C then D)

Added by Stephanie M.

Question

Please give Ace some feedback