64 646
Assignments Done
99,2%
Successfully Done
In September 2018

Answer to Question #41717 in Discrete Mathematics for sanjeev

Question #41717
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
Expert's answer

Not answered

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be first!

Leave a comment

Ask Your question

Submit
Privacy policy Terms and Conditions