I am watching this on the day of my exam, and I understand more than during the entire semester, I wish I had found your channel earlier! Thank you!
@user-ww2lt8ik5x20 күн бұрын
7 years later, this is still best video available
@eatyoass795224 күн бұрын
iloveyou sir, i have an ai exam tomorrow and i didn't know shit, easily understandable it was. ThankYou<3
@shehz35127 күн бұрын
This is the best explanation on introduction to CSPs
@user-sn8te5mq8k27 күн бұрын
I am Arab and I take him in high school
@t.shurid204228 күн бұрын
Thank you sir.
@vinaya5990Ай бұрын
thank you so much for this gem of a video!
@furansartАй бұрын
Now I get it! The whole point of this argument is that, since one digit is enough to make a different number (as you pointed out at the very beginning), if you make a number that has at least one different digit from every other number, then you have a number which is different from all of the others. Since we use the diagonal (which is infinite) we can create an infinite number that is different from them all! It's basically a parametrized rule to establish difference as you go to infinity. Since the pool of the parameters (i and j, the rows and the columns) are infinite, the diagonalization creates an infinite answer that fulfills the condition of having at least one digit different from that of another number for every digit!! This argument was making me really frustrated hahahah, I'm happy that I finally got it. Thank you very much! That simple sentence you said made it all make sense.
@sakshi474Ай бұрын
Thank you so much!!!
@LosSebosFRАй бұрын
Thank you so much ! The explanations are very clear, you make it sound like it's easy! What's with the human calculator by the way ?
@Deafahmi_Ай бұрын
Thankyou sir
@ksaicharanreddy4415Ай бұрын
Still useful in 2024❤
@halimabenyekhlef474Ай бұрын
Think you sir but where is limited search?
@KushagraGoyalBCEАй бұрын
Great explanation
@joshuac9142Ай бұрын
Perfect!
@alfianabdulhalin1873Ай бұрын
Thanks John. This video is a lifesaver. BTW, I've a question. Say I want to drive to the nearest city, and he wants to choose between 3 cities on a map (i.e. 3 goals states/nodes). So does this mean I have to calculate the A* score of each goal state, and then choose the smallest one? Thanks!
@sqlyoutuber8230Ай бұрын
Thank you
@webkalfictservices5138Ай бұрын
Super clear! Thank you very much mister Levine!
@zoc2Ай бұрын
John levine and josh starmer are carrying me so hard my feet aren't even touching the ground
@purvaexceteper93422 ай бұрын
Amazing!!
@UsmanAli-pp2uk2 ай бұрын
Umar noman zinda bad
@memeson692 ай бұрын
this guy is kinda sick with it
@BanHelsing2 ай бұрын
bro is saving my ai course fr i love you Mr Levine
@cookiejar30942 ай бұрын
Your videos help me so much with my course, thanks!
@magicadespell812 ай бұрын
You are a gifted teacher! Thank you!
@LordSarcasticVlogger2 ай бұрын
WATCHING FROM PKMKB
@LordSarcasticVlogger2 ай бұрын
WHAT A GOOD EXPLANATION SIR...THANK YOU VERY MUCH SIR..WATCHING FROM INDIA
@LordSarcasticVlogger2 ай бұрын
WATCHING FROM NIT SRINAGAR,JAMMU AND KASHMIR,INIDA
@kelvinmonari55122 ай бұрын
You are the best profesor ever
@telmagiovana60062 ай бұрын
Thank you, best explanation! Wish I had watched your videos before
@joanitarzzalwango63922 ай бұрын
Got nothing 😂
@niyateyob85202 ай бұрын
Thank you Sir!
@sailaja51752 ай бұрын
crystal clear explanation sir!!
@mahmoudsoliman21153 ай бұрын
error 404
@brianmvukwe55063 ай бұрын
Thank you!!
@omrifishbein71593 ай бұрын
Very well explained. Great! Comments: There is no mention of the queue that supports the search and the size issue associated with it and how it works. Why use a new term "visited" and not just stay with "expanded"?
@brendongong72953 ай бұрын
amazing walkthrough, thank you
@mahwashshahid24993 ай бұрын
@johnLevine Kindly share assessment problem as well with accurate heuristics.
@CJ77.83 ай бұрын
I love how you keep it simple, teaching only what we need to know because it helps me from getting overwhelmed. One video on the subject from you and I'm able to break down and solve more complex problems.
@pratyushshrivastava43623 ай бұрын
Great explanation!
@pratyushshrivastava43623 ай бұрын
High clarity of concept!!!
@rehamyousef78223 ай бұрын
Great 😍😍😍 thank you
@anthonyapm3 ай бұрын
Beautifully explained
@Noah-3573 ай бұрын
What would be a real life example ?. For example, when robo vacuum is trying to clean a house, what would be the example of pruning here ?. Is pruning happening when robo vacuum for example when it says task finish although it's not like skipping task because there are an obstacles blocking its way?
Пікірлер
Very very good Thnk you
Excellent explanation
That was really nice, thank you
i love you
I am watching this on the day of my exam, and I understand more than during the entire semester, I wish I had found your channel earlier! Thank you!
7 years later, this is still best video available
iloveyou sir, i have an ai exam tomorrow and i didn't know shit, easily understandable it was. ThankYou<3
This is the best explanation on introduction to CSPs
I am Arab and I take him in high school
Thank you sir.
thank you so much for this gem of a video!
Now I get it! The whole point of this argument is that, since one digit is enough to make a different number (as you pointed out at the very beginning), if you make a number that has at least one different digit from every other number, then you have a number which is different from all of the others. Since we use the diagonal (which is infinite) we can create an infinite number that is different from them all! It's basically a parametrized rule to establish difference as you go to infinity. Since the pool of the parameters (i and j, the rows and the columns) are infinite, the diagonalization creates an infinite answer that fulfills the condition of having at least one digit different from that of another number for every digit!! This argument was making me really frustrated hahahah, I'm happy that I finally got it. Thank you very much! That simple sentence you said made it all make sense.
Thank you so much!!!
Thank you so much ! The explanations are very clear, you make it sound like it's easy! What's with the human calculator by the way ?
Thankyou sir
Still useful in 2024❤
Think you sir but where is limited search?
Great explanation
Perfect!
Thanks John. This video is a lifesaver. BTW, I've a question. Say I want to drive to the nearest city, and he wants to choose between 3 cities on a map (i.e. 3 goals states/nodes). So does this mean I have to calculate the A* score of each goal state, and then choose the smallest one? Thanks!
Thank you
Super clear! Thank you very much mister Levine!
John levine and josh starmer are carrying me so hard my feet aren't even touching the ground
Amazing!!
Umar noman zinda bad
this guy is kinda sick with it
bro is saving my ai course fr i love you Mr Levine
Your videos help me so much with my course, thanks!
You are a gifted teacher! Thank you!
WATCHING FROM PKMKB
WHAT A GOOD EXPLANATION SIR...THANK YOU VERY MUCH SIR..WATCHING FROM INDIA
WATCHING FROM NIT SRINAGAR,JAMMU AND KASHMIR,INIDA
You are the best profesor ever
Thank you, best explanation! Wish I had watched your videos before
Got nothing 😂
Thank you Sir!
crystal clear explanation sir!!
error 404
Thank you!!
Very well explained. Great! Comments: There is no mention of the queue that supports the search and the size issue associated with it and how it works. Why use a new term "visited" and not just stay with "expanded"?
amazing walkthrough, thank you
@johnLevine Kindly share assessment problem as well with accurate heuristics.
I love how you keep it simple, teaching only what we need to know because it helps me from getting overwhelmed. One video on the subject from you and I'm able to break down and solve more complex problems.
Great explanation!
High clarity of concept!!!
Great 😍😍😍 thank you
Beautifully explained
What would be a real life example ?. For example, when robo vacuum is trying to clean a house, what would be the example of pruning here ?. Is pruning happening when robo vacuum for example when it says task finish although it's not like skipping task because there are an obstacles blocking its way?
Is there goal state for bfs nd dfs
Goated