unit 3 chapter 8 greedy best first search

greedy best first search

[jovanjelic]

I really like you videos. I hope you make more of this, like hill climbing algorithm, Branch and Bound... Thank you so much! :D

[Lee-uwlr]

Can you give a scenario where GBFS will get stuck in a loop? Because if it keeps the nodes it has expanded in memory, it can back track to other nodes, therefore it won't cause looping. I hope you can give an example of Looping. Thank you.

[jadajeree]

Thank you so much for this explanation!

[developerx]

This powerpiont my doctors give us same it, imagen that, they save the words and tell us in it. good job bro.

[niksu]

clear explanation so what will be path cost here ?

[pratikingale]

nice videos keep going sir am wating for more videos nice explination

[sananzahid]

Sir I'm becoming your student right now 4:21 am

[akshathajyothibamanaguli]

Sir there is no clarity in the map diagrams, and numbers are not visible