AO* algorithm in AI

[@kime_wang]

Thank you so much. Well explained ❤

[@phanikumarsimhadri8124]

Well Explained madamji, Thank u so much

[@gauravtewatia3251]

Watched several videos but this is te best explaination

[@rasmiyanishan9751]

Well explained...thank you mam😊

[@70aakashshukla34]

thankyou mam best video on ao* i found on youtube . well explained

[@virendranaik1893]

DH path gives us more optimal one why cant we consider that?

[@jittu.14]

Nice Explained maam thank you

[@arvindg553]

Nice explanation maam

[@anupgupta3644]

Thanks a lot ma'am.
Ma'am would it be possible to get lecture PDF or PPTs?

[@NISHANTHHDCDCS]

tq

[@tharunps8048]

why cant we start from bottom ?

[@Mr19242]

In 1st example AO* algorithm will not explore left subtree i.e stop when revised cost of right node is 15 as 15 < 21 .

[@dr.kavitaoza4007]

Thank you for the inputs. But after getting the revised cost we revisit the left subtree to check again if cost gets optimized further.

[@Mr19242]

@@dr.kavitaoza4007 Mam we only visit left subtree if the revised cost of right subtree came greater than left one but in this case it came to be lesser and thus will not visit left subtree.

[@red5hat]

Excellent explanation, ma'am.

[@kanuriviveknag9294]

What is the time complexity of AO* algorithm mam?

[@saibalaji4713]

What about DH in first example?

[@sanuraj5998]

Yes, value for D node should be updated to 3 from 5

[@usha1782]

not done.. given wrong solution@@sanuraj5998

[@usha1782]

D to h not taken

[@raunaksharma6853]

Amazing

[@dr.kavitaoza4007]

Thank you! Cheers!

[@dhanashripatil3764]

Mam exam main theory ke sath example bhi likhana chahiy ...... ya nhi

[@dr.kavitaoza4007]

Yes you have to write

[@dhanashripatil3764]

@@dr.kavitaoza4007 Thanks mam🙏🙏