2
$\begingroup$

What are the differences between the uniform-cost search (UCS) and greedy best-first search (GBFS) algorithms? How would you convert a UCS into a GBFS?

$\endgroup$
-1
$\begingroup$

UCS : Move to goal seeing minimum backward cost. g(n) Greedy: Move to goal seeing minimum forward cost. h(n) A*: Move to goal seeing minimum backward and forward cost. f(n) = g(n) + h(n)

$\endgroup$
  • 1
    $\begingroup$ Hey, welcome to the site. Your answer would be a lot more useful to a wider audience if you went into a little more detail and defined your terms. $\endgroup$ – Philip Raeisghasem Apr 16 at 5:43

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.