Scribd
Upload
4 views

Lec 6-Informed Search Algorithms (3)

Uploaded by

lenah.buk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Lec 6-Informed Search Algorithms (3)

Uploaded by

lenah.buk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 46

Estimate desirable cost used to select next node

‫منطقيًا كل ما قل عدد الخطوات معناه اننا نمشي بالطريق الصح‬


‫مثل قوقل ماب اذا قل الوقت احتا بالطريق الصح بس اذا لفينا وزاد الوقت معناها اننا دخلنا طريق غلط‬
f(n) = h(n) means "I’m just going to follow the direction that This approach can be quick, but it might not
seems closest to my destination based on my estimate."
No exact distance, just a "best guess" to guide the search
always give the optimal solution because it only
toward the goal. considers how close it "thinks" you are, without
considering the full path cost.

You might also like