Hill climbing

[@srinathtk86]

One of the finest lectures on #AI i have ever seen. hats off to your hard work sir...superb !!!

[@muneshchauhan]

Very well explained using the Block World problem example. Great tutorial by Prof. Deepak. Thanks for posting.

[@zenicv]

11:50 He says no need to sort, but that is not fully accurate as I understood. He has to choose the "best" among the generated nodes and that is implicitly a comparison/sort type of action. What he probably meant is that there is no global sorted list of open nodes I guess....

[@SouravKumar-we2ms]

Very well Explained ..... Cleared so many doubts......Thanks.........

[@natasha1987252]

Excellent video detailed explanation of every single step, thank you for this video :)

[@rohitbale15]

Thanks a lot sir , lecture was simply superb. You are really a awesome teacher!!!!!!!!!!

[@kartikchahal4433]

pure gem

[@jivanmainali1742]

how space comlexity of dfs is O(d*b) i guess it should be O(d)

[@drljubica1]

Thank you for the great lectures.

[@entertainmentprasad4910]

very clearly explanation..thanx for this vedio:)

[@Thegreatindiaexpedition]

wao amazing lecture

[@davisiepmann597]

thanks for share!!

[@shivasharma9555]

thanks alot sir realy very helpful

[@SuganthanHarmless]

It was a nice lecture for me

[@umairalvi7382]

Excellent example of hill climbing other lectures of this series are pathetic

[@narendrarudra3543]

thank you sir

[@shivamjadhav9393]

Excellent sir

[@neerajkasturi2568]

can anybody please provide the java code for the above heuristic approach for blocks world problem..

[@HoangHuy-ng2mk]

very thank for teacher