## Discussion Forum

Que. | 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 |

Answer:g = 1 |