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.
shouldn't we include A's h(n) values why summing up at end?
I find this well explained from south afica im an african indian you made this so easier for me compared to my prescribed textbook
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
Nice Explanation
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
bro it will back up only when we use Depth first search (DFS) in greedy best first search.
personally i have really enjoyed this class, u made it so easy for me to understand,thank you
You're very welcome!
how to find the cost between start A to B,C,E,asking about the values 118,140,75 how did it came??
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.
mam can you please arrange the videos in order topicwise.
is best first search and greedy search is same or different?
Both are different
thank you
You're welcome
Very Nice
Thanks for sharing!!
What happens if two nodes have the same heuristic value?
While implementing this, we found that it takes the first one.
@@WinningCSE How can I get in contact with you, I would like your assistance on some AI questions (Informed search and uninformed search).
Thanks
You are welcome Melih Ekinci
good but
better to explain the calculation of h(n)
Thank you
Sorry for that
Madam Is This Table Will Give In Exam Section??
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.
Good work, well explained, keep doing
Thank you, I will
Thanks, will do!
thank u very much man u r the best
Thank you Nikash Yadav.
you should have made tree first
thank yo
You are welcome, keep watching...
@@WinningCSE where can i find branch and bound lecture ☹
@@5it.005 Branch and bound. Ok
I will try to do this. Which university you are
@@WinningCSE first thank so much ☹❤❤ i rlly value it cuz i get ur explaining v well 💕
J tk Way h
You make things complicated
Is it so
worst example of the life
Thank you
@@rashidpathan6998 tr
Talk louder your voice is not audible
Ok next time
you dont got volume button ?
U should change the device u're using 😂
caste ki baat mat kr aunty
she meant cost pardon her accent english is not mams first language i know its an elephant in the room
i do not recommend you
Thank you 🙏