Hill climbing

Artificial Intelligence by Prof. Deepak Khemani,Department of Computer Science and Engineering,IIT Madras.For more details on NPTEL visit nptel.ac.in
To access the translated content:
1. The translated content of this course is available in regional languages. For details please visit nptel.ac.in/tr...
The video course content can be accessed in the form of regional language text transcripts, books which can be accessed under downloads of each course, subtitles in the video and Video Text Track below the video.
Your feedback is highly appreciated. Kindly fill this form forms.gle/XFZh...
2. Regional language subtitles available for this course
To watch the subtitles in regional languages:
1. Click on the lecture under Course Details.
2. Play the video.
3. Now click on the Settings icon and a list of features will display
4. From that select the option Subtitles/CC.
5. Now select the Language from the available languages to read the subtitle in the regional language.

[@srinathtk86]

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

[@SouravKumar-we2ms]

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

[@muneshchauhan]

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

[@natasha1987252]

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

[@davisiepmann597]

thanks for share!!

[@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....

[@kartikchahal4433]

pure gem

[@entertainmentprasad4910]

very clearly explanation..thanx for this vedio:)

[@umairalvi7382]

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

[@rohitbale15]

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

[@shivasharma9555]

thanks alot sir realy very helpful

[@drljubica1]

Thank you for the great lectures.

[@jivanmainali1742]

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

[@WhenIMetTheWorld]

wao amazing lecture

[@shivamjadhav9393]

Excellent sir

[@SuganthanHarmless]

It was a nice lecture for me

[@narendrarudra3543]

thank you sir

[@HoangHuy-ng2mk]

very thank for teacher

[@neerajkasturi2568]

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

[@your_daddy_mf]

i was watching at 2x ☠☠.....disclaimer this is not right place if you dont know basics ☠☠☠☠