To search the goal state, initially we take some assumed cost h(n), I.e. cost from current state to goal state, after exploring we calculated the original cost g(n), I.e. initial state to current state. Hence h(n) is not original path cost but used to find next state to explore.
Thank you for this great video. But could you explain aigin how do you find the red values between different nodes?? for example 75 between A and B, 140 between A and E und 118 between A and C Thank you in advance
Best videos for AI
Thank you
Your videos are very helpful mam
Day after tomorrow we have ai exam
Your channel is life saviour for ai subject.
All the best
Mam for in greedy best first search you took total of h(n) values as path cost ,in this you took original path cost,is it like that only??
To search the goal state, initially we take some assumed cost h(n), I.e. cost from current state to goal state, after exploring we calculated the original cost g(n), I.e. initial state to current state.
Hence h(n) is not original path cost but used to find next state to explore.
@@WinningCSE Thank you Mam.
@@WinningCSEMam should we take Sum of Heuristic values for Greedy Best First search problems?
@@udaykiranrh welcome
It can't be complete if it is going to an infinite loop
Thank you for this great video.
But could you explain aigin how do you find the red values between different nodes?? for example 75 between A and B, 140 between A and E und 118 between A and C
Thank you in advance
Great suggestion!
@@WinningCSE may you explain it here in the commentar please??
this realy helpfull
Thank you Asik Hossain
🫶👍
Thank you
good explanation madam thank you madam. gv me u r mail id madam
Thank you Mr. Kalyan. Are you a staff or student
@@WinningCSE Mtech student madam from NIT silchar
@@mkalyan2698 that's great. My mailid is sumathi@kec.ac.in
Your videos are very helpful for making notes thanks a tons mam ❤🫶
Thanks for your comments, keep watching, all the best.