×
Log in
Get Started
Travel
Technology
Sports
Marketing
Education
Career
Social Media
+ Explore all categories
Report -
1 Review Best-first search uses an evaluation function f(n) to select the next node for expansion. Greedy best-first search uses f(n) = h(n). Greedy best.
Select
Pornographic
Defamatory
Illegal/Unlawful
Spam
Other Terms Of Service Violation
File a copyright complaint
Please pass captcha verification before submit form