A* algorithm uses f′ = g + h′ to estimate the cost of getting from the initial…
2012
A* algorithm uses f′ = g + h′ to estimate the cost of getting from the initial state to the goal state, where g is a measure of cost getting from initial state to the current node and the function h′ is an estimate of the cost of getting from the current node to the goal state. To find a path involving the fewest number of steps, we should test,
- A.
g = 1
- B.
g = 0
- C.
h′ = 0
- D.
h′ = 1
Attempted by 69 students.
Show answer & explanation
Correct answer: A
In A*:
f(n)=g(n)+h(n)
g(n) = path cost from start
h(n) = estimated cost to goal
To find the fewest number of steps, every move must have equal cost.
So we assign:
g(n)=1 for each step
Then total cost g(n) becomes equal to number of steps, and A* will choose the path with minimum steps.
Answer: g=1
A video solution is available for this question — log in and enroll to watch it.