Greedy Best First Search-Artificial Intelligence-Unit - 1 -Problem Solving -Informed Searching

[@karthikr5161]

shouldn't we include A's h(n) values why summing up at end?

[@ComputerGuru-tk2hg]

I find this well explained from south afica im an african indian you made this so easier for me compared to my prescribed textbook

[@pruthvisavadi6774]

Mam in the case of 2nd example uh took 'c' as a path after that 'D' & 'E' are already visited but can we visit 'F' or not ?mam

[@kirtanlokadiya5098]

Nice Explanation

[@Lee-uw6lr]

Why will GBFS back up if it meets a dead end? Then how will GBFS get stuck in a loop then? I hope you can answer my question

[@Jai1M]

bro it will back up only when we use Depth first search (DFS) in greedy best first search.

[@Mexton-qs5td]

personally i have really enjoyed this class, u made it so easy for me to understand,thank you

[@WinningCSE]

You're very welcome!

[@balachandar375]

how to find the cost between start A to B,C,E,asking about the values 118,140,75 how did it came??

[@franky_sagan]

That was already given in the question itself. It is basically cost between each node. If you calculate that you will get the total cost and if you calculate the heuristic value you will get the total distance so we are finding the optimal solution with help of either characteristic value or cost value. Anyhow, this algorithm is not optimal and it is prone to getting struck.

[@surajr4757]

mam can you please arrange the videos in order topicwise.

[@037edattabhavani4]

is best first search and greedy search is same or different?

[@WinningCSE]

Both are different

[@TempMaza]

thank you

[@WinningCSE]

You're welcome

[@Zainofficialyo]

Very Nice

[@WinningCSE]

Thanks for sharing!!

[@lutwetweshadrackduncan7384]

What happens if two nodes have the same heuristic value?

[@WinningCSE]

While implementing this, we found that it takes the first one.

[@lutwetweshadrackduncan7384]

@@WinningCSE How can I get in contact with you, I would like your assistance on some AI questions (Informed search and uninformed search).

[@melihekinci7758]

Thanks

[@WinningCSE]

You are welcome Melih Ekinci

[@Neeharika_Sompalli_]

good but
better to explain the calculation of h(n)

[@WinningCSE]

Thank you

[@WinningCSE]

Sorry for that

[@khan7423]

Madam Is This Table Will Give In Exam Section??

[@WinningCSE]

If it is problem then surely they will give, otherwise if you asked to explain the topic with your own example, then you have to draw the table.

[@senthilkumarsadhasivam6984]

Good work, well explained, keep doing

[@WinningCSE]

Thank you, I will

[@WinningCSE]

Thanks, will do!

[@bikashyadav1421]

thank u very much man u r the best

[@WinningCSE]

Thank you Nikash Yadav.

[@rashidpathan6998]

you should have made tree first

[@5it.005]

thank yo

[@WinningCSE]

You are welcome, keep watching...

[@5it.005]

@@WinningCSE where can i find branch and bound lecture ☹

[@WinningCSE]

@@5it.005 Branch and bound. Ok

[@WinningCSE]

I will try to do this. Which university you are

[@5it.005]

@@WinningCSE first thank so much ☹❤❤ i rlly value it cuz i get ur explaining v well 💕

[@MuhammadRasheed-m5z]

J tk Way h

[@Mrk63222]

You make things complicated

[@WinningCSE]

Is it so

[@rashidpathan6998]

worst example of the life

[@WinningCSE]

Thank you

[@sumanth8421]

@@rashidpathan6998 tr

[@satheeshk6861]

Talk louder your voice is not audible

[@WinningCSE]

Ok next time

[@jtdatacomparisons]

you dont got volume button ?

[@taranathb3775]

U should change the device u're using 😂

[@dhyanjoshi9638]

caste ki baat mat kr aunty

[@ComputerGuru-tk2hg]

she meant cost pardon her accent english is not mams first language i know its an elephant in the room

[@rashidpathan6998]

i do not recommend you

[@WinningCSE]

Thank you 🙏