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.
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 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.
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.
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.
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!
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.
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.