Constraint Satisfaction: introduction

Introduction to Constraint Satisfaction Problems and the backtracking algorithm

[@ahmadalawi6218]

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.

[@aliosman8681]

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.

[@michelleIX]

Concise,intuitive , and full bodied explaination

[@BeginningProgrammer]

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.

[@muhammedbayram4624]

John, you are amazing ! I studied AI topics from your videos and got 96 and 100 from my exams. Thanks !

[@shehz351]

This is the best explanation on introduction to CSPs

[@chiofoegbu9019]

Thank you. 👏👏 You made this easy for a topic I'm learning for the first time

[@CJ77.8]

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.

[@soraisfinallyhere1305]

so much better than my professor thanks your videos might help me pass my A. I. class hopefully

[@lebruce9503]

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.

[@fabriciomagalhaessena2289]

The better summary about Constraint Satisfaction! Thanks for this classroom!

[@hnsc1]

Hello sir, just wanted to say that your videos are very concise and helpful. Thank you so much!

[@markomekjavic]

Really helped with my understanding of the topic, cheers!

[@spongebobsquarepants4576]

Thank you professor, you are brilliant! Toda!

[@manos942]

This reminds me of the way Prolog works a lot. Thanks for the vid!

[@kasvith]

Clearly explained, thanks for helping students

[@user-jt2sy4hr4e]

Perfect lecture on Constraint Satisfaction. Hope to add fordward checking to prune the domains.

[@LY-bh8tf]

I will say this professor is always the best

[@MunhuAfro]

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.

[@KhaledSharif1993]

You are an excellent teacher, thank you!

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

[@royohana9002]

Thanks for one of the best explanations I heard!

[@behnamshahed96]

thanks a lot for your amazing videos, I really enjoy your channel

[@abramswee]

thank you. clear and concise. love it.

[@AliAkbar-fn6ei]

You just made it so easier for us to understand, thank you so much respected Sir.

[@_._lis_._]

Thankyou so much!!!!!!! I was stuck on this for 3 days..

[@hanshusyed-lq5ng]

Thank you so much for making it easier and simple sir 😊

[@rnvaamonde]

Very clear, thanks!!

[@michelleIX]

Great video!!! Thank you so much

[@converti76]

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!

[@jasminemasopeh1562]

Thank you for this. I understand a bit more!

[@tomasvaldivieso126]

Great work. Thank you

[@niels.faurskov]

You have a lovely voice and great video as well, keep it up :)

[@xpertstrategist2216]

perfectly explained .thank you so much

[@HailayKidu]

Precise and clear 👏

[@UrQuietGamer]

Well explained video!

[@hussein2698]

Helpful, thanks.

[@nageswarkv]

Excellent explanation

[@blackfromabove9383]

Many many thanks!

[@kjohari_]

You are my favourite, you are my king old man

[@Toolever]

succinct is the word! Thanks prof

[@evangelosbatsalis9551]

Thank you very much, clrearly explained.

[@NewMovieCenter]

really helpful. thank you sir.

[@faisalalqhtani8891]

Thank you so much ❤️

[@Teog1992]

superb job uncle

[@yami_caramel932]

thank you :)

[@tacticfeed2694]

thx for video

[@rad6014]

Good introduction

[@damnfreakingsien]

print "Thank you for your concise explanation!"

[@georgiandanciu3567]

pls install python 3.8 , 2 is obsolete

[@NianLi]

How about options like A=3, B=1, C=2? Should we consider it?

[@Themojii]

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.

[@ooohdraft]

legend

[@georgiandanciu3567]

excelent

[@manalpambhar2363]

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.

[@astronaut205]

thank you for this video the guy who gave negative represents the only accepted solution in case of constrain = "minimum intelligence" I guess

[@Marc-pt4oh]

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.

[@martinzhao7193]

I love you

[@binapatel2208]

would B not equal to C and A not equal to C be considered unary constrinats?

[@BeginningProgrammer]

given a CSP problem can you give and example of how you formulate the variables

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

[@MIT60346]

So... the backtrack alg is exponential 🙈

[@chevlonmacguinstudios]

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)