Introduction to Constraint Satisfaction Problems and the backtracking algorithm
Жүктеу.....
Пікірлер: 66
@ahmadalawi62182 жыл бұрын
Oh man, I love you. I wish I watched this short video instead of wasting more than an hour hearing my professor explaining it terribly.
@Arash7m Жыл бұрын
John Levine has teached me more than entire courses I've taken honestly. The guy is a genius at teaching complex topics in very easy to understand videos.
@aliosman86813 жыл бұрын
That is really a very helpful lecture. I appreciate your efforts. You made us understand us complex concepts in AI in a very short time. Keep it up Dr.
@shehz35123 күн бұрын
This is the best explanation on introduction to CSPs
@michelleIX2 жыл бұрын
Concise,intuitive , and full bodied explaination
@BeginningProgrammer2 жыл бұрын
That was such an awesome explanation of not just CSP but also backtracking. I've always had a hard time showing back tracking in sequence. Thanks for sharing.
@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.
@muhammedbayram46242 жыл бұрын
John, you are amazing ! I studied AI topics from your videos and got 96 and 100 from my exams. Thanks !
@soraisfinallyhere1305 Жыл бұрын
so much better than my professor thanks your videos might help me pass my A. I. class hopefully
@spongebobsquarepants45762 жыл бұрын
Thank you professor, you are brilliant! Toda!
@chiofoegbu90192 жыл бұрын
Thank you. 👏👏 You made this easy for a topic I'm learning for the first time
@royohana90024 ай бұрын
Thanks for one of the best explanations I heard!
@lebruce950310 ай бұрын
Thank you very much for making this video! I've been struggling to understand backtracking based on textbook descriptions. Seeing it happen in real time was incredibly helpful.
@fabriciomagalhaessena22892 жыл бұрын
The better summary about Constraint Satisfaction! Thanks for this classroom!
@markomekjavic4 жыл бұрын
Really helped with my understanding of the topic, cheers!
@manos9424 жыл бұрын
This reminds me of the way Prolog works a lot. Thanks for the vid!
@hnsc13 жыл бұрын
Hello sir, just wanted to say that your videos are very concise and helpful. Thank you so much!
@LY-bh8tf4 жыл бұрын
I will say this professor is always the best
@kasvith4 жыл бұрын
Clearly explained, thanks for helping students
@MunhuAfro4 жыл бұрын
I had had a problem with assignment of domain variable values. I thought before that all three possible values had to be added and checked at the same time, in different orders. Boy was I wrong. Thanks for the clarification. Melted my frustration away in 7.
@KhaledSharif19932 жыл бұрын
You are an excellent teacher, thank you!
@user-jt2sy4hr4e4 жыл бұрын
Perfect lecture on Constraint Satisfaction. Hope to add fordward checking to prune the domains.
@abramswee2 жыл бұрын
thank you. clear and concise. love it.
@nageswarkv3 күн бұрын
Excellent explanation
@hanshusyed-lq5ng5 ай бұрын
Thank you so much for making it easier and simple sir 😊
@princeelliot2836 Жыл бұрын
Thank you so much for this amazing lecture. Your way of explaining the content is really good understandable. You've just earned a new subscriber.
@behnamshahed964 жыл бұрын
thanks a lot for your amazing videos, I really enjoy your channel
@converti7610 ай бұрын
Thanks for the clear explanation, Im bulding a project in python and I really need to do it with that type of Algorithm now seems I can do it that way!
@jasminemasopeh15623 ай бұрын
Thank you for this. I understand a bit more!
@_._lis_._ Жыл бұрын
Thankyou so much!!!!!!! I was stuck on this for 3 days..
@rnvaamonde3 жыл бұрын
Very clear, thanks!!
@AliAkbar-fn6ei2 жыл бұрын
You just made it so easier for us to understand, thank you so much respected Sir.
@michelleIX2 жыл бұрын
Great video!!! Thank you so much
@kjohari_4 жыл бұрын
You are my favourite, you are my king old man
@HailayKidu Жыл бұрын
Precise and clear 👏
@Toolever3 жыл бұрын
succinct is the word! Thanks prof
@xpertstrategist22162 жыл бұрын
perfectly explained .thank you so much
@tomasvaldivieso1262 жыл бұрын
Great work. Thank you
@niels.faurskov4 жыл бұрын
You have a lovely voice and great video as well, keep it up :)
@evangelosbatsalis95512 жыл бұрын
Thank you very much, clrearly explained.
@blackfromabove93833 жыл бұрын
Many many thanks!
@hussein2698 Жыл бұрын
Helpful, thanks.
@UrQuietGamer Жыл бұрын
Well explained video!
@NewMovieCenter3 жыл бұрын
really helpful. thank you sir.
@faisalalqhtani8891 Жыл бұрын
Thank you so much ❤️
@Teog19922 жыл бұрын
superb job uncle
@damnfreakingsien3 жыл бұрын
print "Thank you for your concise explanation!"
@georgiandanciu3567
3 жыл бұрын
pls install python 3.8 , 2 is obsolete
@ooohdraft7 ай бұрын
legend
@tacticfeed26942 жыл бұрын
thx for video
@yami_caramel9322 жыл бұрын
thank you :)
@rad60144 жыл бұрын
Good introduction
@georgiandanciu35673 жыл бұрын
excelent
@NianLi4 жыл бұрын
How about options like A=3, B=1, C=2? Should we consider it?
@Themojii
4 жыл бұрын
What you said is another solution. But it depends on the problem that how many solution you want. If one solution satisfies the problem, you would stop as soon as you get the first solution. Otherwise you continue to get more solutions.
@astronaut2053 жыл бұрын
thank you for this video the guy who gave negative represents the only accepted solution in case of constrain = "minimum intelligence" I guess
@manalpambhar23634 жыл бұрын
Sir If we are going to forward then A=3, B=1 and C=2 and A=3, B=2 and C=1 that is also right answer According to this condition. My question is now what is the best answer.
@Marc-pt4oh2 жыл бұрын
Failin with 2,1,1 and moving to 2,1,3 is not calling a backtrack but a fail, right ? We backtrack only when there is no more values in the domain and that we go up in the levels.
@BeginningProgrammer2 жыл бұрын
given a CSP problem can you give and example of how you formulate the variables
@martinzhao71933 жыл бұрын
I love you
@binapatel22084 жыл бұрын
would B not equal to C and A not equal to C be considered unary constrinats?
@WahranRai Жыл бұрын
3:27 You dont know the value of B yet but you know the domain of B: 1,2,3 and there is not a value of B
@MIT603464 жыл бұрын
So... the backtrack alg is exponential 🙈
@chevlonmacguinstudios2 жыл бұрын
They should call it the padlock algorithm
@lmao4982 Жыл бұрын
Wait, it's all sudoku?
@juguangxiao9788 Жыл бұрын
There are other solutions (so that this is NOT complete) (A, B, C) = (3, 1, 2), (3, 2, 1), (3, 1, 1), and (3, 2, 2)
Пікірлер: 66
Oh man, I love you. I wish I watched this short video instead of wasting more than an hour hearing my professor explaining it terribly.
John Levine has teached me more than entire courses I've taken honestly. The guy is a genius at teaching complex topics in very easy to understand videos.
That is really a very helpful lecture. I appreciate your efforts. You made us understand us complex concepts in AI in a very short time. Keep it up Dr.
This is the best explanation on introduction to CSPs
Concise,intuitive , and full bodied explaination
That was such an awesome explanation of not just CSP but also backtracking. I've always had a hard time showing back tracking in sequence. Thanks for sharing.
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.
John, you are amazing ! I studied AI topics from your videos and got 96 and 100 from my exams. Thanks !
so much better than my professor thanks your videos might help me pass my A. I. class hopefully
Thank you professor, you are brilliant! Toda!
Thank you. 👏👏 You made this easy for a topic I'm learning for the first time
Thanks for one of the best explanations I heard!
Thank you very much for making this video! I've been struggling to understand backtracking based on textbook descriptions. Seeing it happen in real time was incredibly helpful.
The better summary about Constraint Satisfaction! Thanks for this classroom!
Really helped with my understanding of the topic, cheers!
This reminds me of the way Prolog works a lot. Thanks for the vid!
Hello sir, just wanted to say that your videos are very concise and helpful. Thank you so much!
I will say this professor is always the best
Clearly explained, thanks for helping students
I had had a problem with assignment of domain variable values. I thought before that all three possible values had to be added and checked at the same time, in different orders. Boy was I wrong. Thanks for the clarification. Melted my frustration away in 7.
You are an excellent teacher, thank you!
Perfect lecture on Constraint Satisfaction. Hope to add fordward checking to prune the domains.
thank you. clear and concise. love it.
Excellent explanation
Thank you so much for making it easier and simple sir 😊
Thank you so much for this amazing lecture. Your way of explaining the content is really good understandable. You've just earned a new subscriber.
thanks a lot for your amazing videos, I really enjoy your channel
Thanks for the clear explanation, Im bulding a project in python and I really need to do it with that type of Algorithm now seems I can do it that way!
Thank you for this. I understand a bit more!
Thankyou so much!!!!!!! I was stuck on this for 3 days..
Very clear, thanks!!
You just made it so easier for us to understand, thank you so much respected Sir.
Great video!!! Thank you so much
You are my favourite, you are my king old man
Precise and clear 👏
succinct is the word! Thanks prof
perfectly explained .thank you so much
Great work. Thank you
You have a lovely voice and great video as well, keep it up :)
Thank you very much, clrearly explained.
Many many thanks!
Helpful, thanks.
Well explained video!
really helpful. thank you sir.
Thank you so much ❤️
superb job uncle
print "Thank you for your concise explanation!"
@georgiandanciu3567
3 жыл бұрын
pls install python 3.8 , 2 is obsolete
legend
thx for video
thank you :)
Good introduction
excelent
How about options like A=3, B=1, C=2? Should we consider it?
@Themojii
4 жыл бұрын
What you said is another solution. But it depends on the problem that how many solution you want. If one solution satisfies the problem, you would stop as soon as you get the first solution. Otherwise you continue to get more solutions.
thank you for this video the guy who gave negative represents the only accepted solution in case of constrain = "minimum intelligence" I guess
Sir If we are going to forward then A=3, B=1 and C=2 and A=3, B=2 and C=1 that is also right answer According to this condition. My question is now what is the best answer.
Failin with 2,1,1 and moving to 2,1,3 is not calling a backtrack but a fail, right ? We backtrack only when there is no more values in the domain and that we go up in the levels.
given a CSP problem can you give and example of how you formulate the variables
I love you
would B not equal to C and A not equal to C be considered unary constrinats?
3:27 You dont know the value of B yet but you know the domain of B: 1,2,3 and there is not a value of B
So... the backtrack alg is exponential 🙈
They should call it the padlock algorithm
Wait, it's all sudoku?
There are other solutions (so that this is NOT complete) (A, B, C) = (3, 1, 2), (3, 2, 1), (3, 1, 1), and (3, 2, 2)