I really appreciated the clear explanation of value iteration and how it can be used to solve MDPs. The examples made the concepts much easier to grasp. Thanks for simplifying a complex topic!

I just watched 7 videos on this and you have the clearest and most detailed explanation! SO good!

Why would there be a chance of a pit in cell [1,2] if it's not adjacent to the actual pit in cell [2,1]?

Very well explained, thanks!

don't waste your time here homies, this ain't it

Thank you so much !!

Wonderful Lecture !

How the L can be true when the P is not true or we are using the A or B to make L true

add also that in playlist of AI

So you are giving two example where one of the environment is static and one of them is dynamic and you are giving an example of robot if in a sequence of time robot do some move and somebody cross it there is a change in the environment but in the same example same page you said in the poker game Oregon the chess game the boxes are 64 but the position of the pcs on the chess also change that does not consider as a dynamic because there is a change in environment and the counter is in the robot example the room is same it does not extend it so why are we considering it as a dynamic

your local search videos were quality videos, thank you for your hard work <3

Bro kinda sounds like Elon Musk 😂 very nice vid

Great video! Thanks alot!

this series saved me truly thank you

thank you so much !

bro causally wrote upside down.

فناان

Very nice walkthrough of the concepts of entropy and gain. Ty.

thank you

THATS AMAZING!

Great tutorial. The steps are still very much applicable in today's world.

Great video. I love it when people code up a direct translation first, and then start to optimize it as needed. That way you get a really nice trace of what changed and for what reason. For example in the sums you might overflow your number representation. So you might want to divide each number first. This get's you all the way up, but is slower and might be a problem with smaller numbers. Or you really need to speed things up so you do something like add two adjesent numbers and shift them to divide by two. That way you can really tailor down an algorithm to the requirements of your problem or application.

4:56 🎆

Dont say sorry for a long video bro, fire explanation!

you gave me, what i searched for. Thank you

Thanks

This is the BEST video on tree, gain and entropy on KZbin.

2024😅

very good video!

Thank you so much for these videos! This might save my exam tomorrow!

OMG!!!! Thank you for this. I have watched a ton of videos but this was easy to follow and very well explained.

good video

Lalalala😂 legends one day before exam

Kya bachodi hai

How con collect my paypal

👍

how do we know which arguments to pass as a user to a particular script or a program ?

which book or slides you used for this video? i.e. where can I learn more about conditional independence and inference

Thank you

Thank you so much!! you explained it very simple and fast. your video is still helping years later

You explain really well

aren't we suppose calculate THETA1 and THETA2

nothing entails everything, soooooo deep

This helped a lot, thank you! :)

Thanks for this video!! Cleared a lot of doubts for me.

why yall hating on an algorithm video 😭

Best explanation I've seen so far!

This Process is now Outdated. The process as of Jan 2024 is as below: Open IntelliJ, Arrive at “Welcome to IntelliJ IDEA” dialog box. File > Learn and Teach > Browse Courses Now search for the course you want to practice … Then enroll or open the project.

Great video, thank you

Great explanation brother