Answer to Question #31006 in Quantitative Methods for Sujata Roy

Question

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 the cost of 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 set
(A) g = 1 (B) g = 0
(C) h' = 0 (D) h' = 1