Question

Exercise: Search Algorithms The following figure shows a portion of a partially expanded search tree. Each arc between nodes is labeled with the cost of the corresponding operator, and the leaves are labeled with the value of the heuristic function, h. Which node (use the node's letter) will be expanded next by each of the following search algorithms? (a) Depth-first search (b) Breadth-first search (c) Uniform-cost search (d) Greedy search (e) A* search A h=20 3 5 B 19 h=14 C D 6 h=18 4 5 5 h=15 E F G H h=10 h=12 h=8 h=10

          Exercise: Search Algorithms
The following figure shows a portion of a partially expanded search tree.
Each arc between nodes is labeled with the cost of the corresponding
operator, and the leaves are labeled with the value of the heuristic function,
h.
Which node (use the node's letter) will be expanded next by each of the
following search algorithms?
(a) Depth-first search
(b) Breadth-first search
(c) Uniform-cost search
(d) Greedy search
(e) A* search
A
h=20
3
5
B
19
h=14
C
D
6
h=18
4
5
5
h=15
E
F
G
H
h=10
h=12
h=8
h=10

Exercise: Search Algorithms
The following figure shows a portion of a partially expanded search tree.
Each arc between nodes is labeled with the cost of the corresponding
operator, and the leaves are labeled with the value of the heuristic function,
h.
Which node (use the node's letter) will be expanded next by each of the
following search algorithms?
(a) Depth-first search
(b) Breadth-first search
(c) Uniform-cost search
(d) Greedy search
(e) A* search
A
h=20
3
5
B
19
h=14
C
D
6
h=18
4
5
5
h=15
E
F
G
H
h=10
h=12
h=8
h=10

Added by Katherine W.

Question

Please give Ace some feedback